./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version b2eff8ba
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f4db37-a282-4f89-98ea-9d471b905a56/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f4db37-a282-4f89-98ea-9d471b905a56/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_59f4db37-a282-4f89-98ea-9d471b905a56/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f4db37-a282-4f89-98ea-9d471b905a56/bin/uautomizer-GMMbpWq8iD/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f4db37-a282-4f89-98ea-9d471b905a56/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_59f4db37-a282-4f89-98ea-9d471b905a56/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 b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
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:33:36,803 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-10-28 23:33:36,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-10-28 23:33:36,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-10-28 23:33:36,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-10-28 23:33:36,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-10-28 23:33:36,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-10-28 23:33:36,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-10-28 23:33:36,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-10-28 23:33:36,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-10-28 23:33:36,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-10-28 23:33:36,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-10-28 23:33:36,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-10-28 23:33:36,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-10-28 23:33:36,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-10-28 23:33:36,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-10-28 23:33:36,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-10-28 23:33:36,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-10-28 23:33:36,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-10-28 23:33:36,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-10-28 23:33:36,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-10-28 23:33:36,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-10-28 23:33:36,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-10-28 23:33:36,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-10-28 23:33:36,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-10-28 23:33:36,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-10-28 23:33:36,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-10-28 23:33:36,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-10-28 23:33:36,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-10-28 23:33:36,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-10-28 23:33:36,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-10-28 23:33:36,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-10-28 23:33:36,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-10-28 23:33:36,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-10-28 23:33:36,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-10-28 23:33:36,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-10-28 23:33:36,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-10-28 23:33:36,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-10-28 23:33:36,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-10-28 23:33:36,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-10-28 23:33:36,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-10-28 23:33:36,973 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f4db37-a282-4f89-98ea-9d471b905a56/bin/uautomizer-GMMbpWq8iD/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2021-10-28 23:33:37,017 INFO L113 SettingsManager]: Loading preferences was successful
[2021-10-28 23:33:37,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-10-28 23:33:37,018 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-10-28 23:33:37,019 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-10-28 23:33:37,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-10-28 23:33:37,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-10-28 23:33:37,021 INFO L138 SettingsManager]: * Use SBE=true
[2021-10-28 23:33:37,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-10-28 23:33:37,021 INFO L138 SettingsManager]: * sizeof long=4
[2021-10-28 23:33:37,022 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2021-10-28 23:33:37,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-10-28 23:33:37,022 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-10-28 23:33:37,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-10-28 23:33:37,023 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2021-10-28 23:33:37,023 INFO L138 SettingsManager]: * Bitprecise bitfields=true
[2021-10-28 23:33:37,023 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2021-10-28 23:33:37,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-10-28 23:33:37,024 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2021-10-28 23:33:37,024 INFO L138 SettingsManager]: * sizeof long double=12
[2021-10-28 23:33:37,025 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-10-28 23:33:37,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-10-28 23:33:37,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-10-28 23:33:37,026 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-10-28 23:33:37,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-28 23:33:37,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-10-28 23:33:37,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-10-28 23:33:37,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-10-28 23:33:37,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-10-28 23:33:37,027 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2021-10-28 23:33:37,028 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_59f4db37-a282-4f89-98ea-9d471b905a56/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_59f4db37-a282-4f89-98ea-9d471b905a56/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 -> b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad
[2021-10-28 23:33:37,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-10-28 23:33:37,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-10-28 23:33:37,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-10-28 23:33:37,423 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-10-28 23:33:37,426 INFO L275 PluginConnector]: CDTParser initialized
[2021-10-28 23:33:37,427 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f4db37-a282-4f89-98ea-9d471b905a56/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c
[2021-10-28 23:33:37,530 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f4db37-a282-4f89-98ea-9d471b905a56/bin/uautomizer-GMMbpWq8iD/data/463365aec/f9973e26db7647c092ab87049661cded/FLAG01dfe3997
[2021-10-28 23:33:38,220 INFO L306 CDTParser]: Found 1 translation units.
[2021-10-28 23:33:38,221 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f4db37-a282-4f89-98ea-9d471b905a56/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c
[2021-10-28 23:33:38,241 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f4db37-a282-4f89-98ea-9d471b905a56/bin/uautomizer-GMMbpWq8iD/data/463365aec/f9973e26db7647c092ab87049661cded/FLAG01dfe3997
[2021-10-28 23:33:38,509 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f4db37-a282-4f89-98ea-9d471b905a56/bin/uautomizer-GMMbpWq8iD/data/463365aec/f9973e26db7647c092ab87049661cded
[2021-10-28 23:33:38,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-10-28 23:33:38,518 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2021-10-28 23:33:38,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-10-28 23:33:38,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-10-28 23:33:38,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-10-28 23:33:38,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:33:38" (1/1) ...
[2021-10-28 23:33:38,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c529165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:33:38, skipping insertion in model container
[2021-10-28 23:33:38,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:33:38" (1/1) ...
[2021-10-28 23:33:38,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-10-28 23:33:38,669 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-10-28 23:33:39,099 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_59f4db37-a282-4f89-98ea-9d471b905a56/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598]
[2021-10-28 23:33:39,113 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-28 23:33:39,132 INFO L203 MainTranslator]: Completed pre-run
[2021-10-28 23:33:39,321 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_59f4db37-a282-4f89-98ea-9d471b905a56/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598]
[2021-10-28 23:33:39,322 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-28 23:33:39,357 INFO L208 MainTranslator]: Completed translation
[2021-10-28 23:33:39,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:33:39 WrapperNode
[2021-10-28 23:33:39,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-10-28 23:33:39,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-10-28 23:33:39,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-10-28 23:33:39,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-10-28 23:33:39,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:33:39" (1/1) ...
[2021-10-28 23:33:39,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:33:39" (1/1) ...
[2021-10-28 23:33:39,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:33:39" (1/1) ...
[2021-10-28 23:33:39,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:33:39" (1/1) ...
[2021-10-28 23:33:39,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:33:39" (1/1) ...
[2021-10-28 23:33:39,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:33:39" (1/1) ...
[2021-10-28 23:33:39,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:33:39" (1/1) ...
[2021-10-28 23:33:39,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-10-28 23:33:39,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-10-28 23:33:39,492 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-10-28 23:33:39,492 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-10-28 23:33:39,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:33:39" (1/1) ...
[2021-10-28 23:33:39,503 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-28 23:33:39,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f4db37-a282-4f89-98ea-9d471b905a56/bin/uautomizer-GMMbpWq8iD/z3
[2021-10-28 23:33:39,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f4db37-a282-4f89-98ea-9d471b905a56/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2021-10-28 23:33:39,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f4db37-a282-4f89-98ea-9d471b905a56/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2021-10-28 23:33:39,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2021-10-28 23:33:39,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-10-28 23:33:39,601 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2021-10-28 23:33:39,602 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init
[2021-10-28 23:33:39,602 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy
[2021-10-28 23:33:39,604 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread
[2021-10-28 23:33:39,604 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp
[2021-10-28 23:33:39,604 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice
[2021-10-28 23:33:39,604 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete
[2021-10-28 23:33:39,606 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo
[2021-10-28 23:33:39,606 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests
[2021-10-28 23:33:39,606 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init
[2021-10-28 23:33:39,606 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2021-10-28 23:33:39,607 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest
[2021-10-28 23:33:39,607 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink
[2021-10-28 23:33:39,607 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription
[2021-10-28 23:33:39,607 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface
[2021-10-28 23:33:39,608 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState
[2021-10-28 23:33:39,608 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired
[2021-10-28 23:33:39,608 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver
[2021-10-28 23:33:39,608 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest
[2021-10-28 23:33:39,609 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent
[2021-10-28 23:33:39,609 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject
[2021-10-28 23:33:39,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle
[2021-10-28 23:33:39,609 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread
[2021-10-28 23:33:39,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose
[2021-10-28 23:33:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose
[2021-10-28 23:33:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl
[2021-10-28 23:33:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters
[2021-10-28 23:33:39,612 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest
[2021-10-28 23:33:39,612 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn
[2021-10-28 23:33:39,612 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2021-10-28 23:33:39,613 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2021-10-28 23:33:39,613 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2021-10-28 23:33:39,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-10-28 23:33:39,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char
[2021-10-28 23:33:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2021-10-28 23:33:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long
[2021-10-28 23:33:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy
[2021-10-28 23:33:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread
[2021-10-28 23:33:39,615 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp
[2021-10-28 23:33:39,615 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice
[2021-10-28 23:33:39,615 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete
[2021-10-28 23:33:39,615 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo
[2021-10-28 23:33:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest
[2021-10-28 23:33:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink
[2021-10-28 23:33:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription
[2021-10-28 23:33:39,617 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface
[2021-10-28 23:33:39,617 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState
[2021-10-28 23:33:39,617 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver
[2021-10-28 23:33:39,617 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent
[2021-10-28 23:33:39,618 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject
[2021-10-28 23:33:39,618 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle
[2021-10-28 23:33:39,618 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread
[2021-10-28 23:33:39,619 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose
[2021-10-28 23:33:39,619 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose
[2021-10-28 23:33:39,619 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest
[2021-10-28 23:33:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl
[2021-10-28 23:33:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters
[2021-10-28 23:33:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn
[2021-10-28 23:33:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest
[2021-10-28 23:33:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init
[2021-10-28 23:33:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests
[2021-10-28 23:33:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init
[2021-10-28 23:33:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2021-10-28 23:33:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired
[2021-10-28 23:33:39,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2021-10-28 23:33:39,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-10-28 23:33:39,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-10-28 23:33:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-10-28 23:33:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2021-10-28 23:33:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-10-28 23:33:39,915 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:33:39,955 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false;
[2021-10-28 23:33:39,956 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false;
[2021-10-28 23:33:39,987 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:33:40,010 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false;
[2021-10-28 23:33:40,011 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false;
[2021-10-28 23:33:40,019 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:33:40,471 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false;
[2021-10-28 23:33:40,471 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false;
[2021-10-28 23:33:40,477 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:33:40,558 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false;
[2021-10-28 23:33:40,558 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false;
[2021-10-28 23:33:40,573 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:33:40,592 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false;
[2021-10-28 23:33:40,592 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false;
[2021-10-28 23:33:40,674 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:33:40,682 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false;
[2021-10-28 23:33:40,683 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false;
[2021-10-28 23:33:40,683 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:33:40,692 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false;
[2021-10-28 23:33:40,692 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false;
[2021-10-28 23:33:40,693 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:33:40,703 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false;
[2021-10-28 23:33:40,704 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false;
[2021-10-28 23:33:40,771 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:33:40,829 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false;
[2021-10-28 23:33:40,830 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false;
[2021-10-28 23:33:40,835 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:33:41,013 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false;
[2021-10-28 23:33:41,014 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false;
[2021-10-28 23:33:41,117 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:33:41,125 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false;
[2021-10-28 23:33:41,126 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false;
[2021-10-28 23:33:41,126 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:33:41,139 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false;
[2021-10-28 23:33:41,140 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false;
[2021-10-28 23:33:41,140 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:33:41,146 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false;
[2021-10-28 23:33:41,146 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false;
[2021-10-28 23:33:41,175 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-10-28 23:33:41,176 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2021-10-28 23:33:41,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:33:41 BoogieIcfgContainer
[2021-10-28 23:33:41,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-10-28 23:33:41,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-10-28 23:33:41,182 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-10-28 23:33:41,189 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-10-28 23:33:41,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 11:33:38" (1/3) ...
[2021-10-28 23:33:41,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4d5a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:33:41, skipping insertion in model container
[2021-10-28 23:33:41,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:33:39" (2/3) ...
[2021-10-28 23:33:41,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4d5a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:33:41, skipping insertion in model container
[2021-10-28 23:33:41,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:33:41" (3/3) ...
[2021-10-28 23:33:41,193 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c
[2021-10-28 23:33:41,200 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-10-28 23:33:41,200 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-10-28 23:33:41,254 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2021-10-28 23:33:41,261 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:33:41,261 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2021-10-28 23:33:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 390 states, 288 states have (on average 1.4722222222222223) internal successors, (424), 315 states have internal predecessors, (424), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71)
[2021-10-28 23:33:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2021-10-28 23:33:41,306 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:33:41,307 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:33:41,308 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:33:41,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:33:41,315 INFO L85 PathProgramCache]: Analyzing trace with hash 495257184, now seen corresponding path program 1 times
[2021-10-28 23:33:41,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:33:41,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017154594]
[2021-10-28 23:33:41,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:33:41,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:33:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:41,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:33:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:41,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:33:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:41,941 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:33:41,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:33:41,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017154594]
[2021-10-28 23:33:41,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017154594] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:33:41,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:33:41,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:33:41,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031137851]
[2021-10-28 23:33:41,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2021-10-28 23:33:41,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:33:41,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-28 23:33:41,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-10-28 23:33:41,984 INFO L87 Difference]: Start difference. First operand has 390 states, 288 states have (on average 1.4722222222222223) internal successors, (424), 315 states have internal predecessors, (424), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) 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:33:43,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:33:43,440 INFO L93 Difference]: Finished difference Result 429 states and 603 transitions.
[2021-10-28 23:33:43,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-10-28 23:33:43,442 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:33:43,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:33:43,481 INFO L225 Difference]: With dead ends: 429
[2021-10-28 23:33:43,482 INFO L226 Difference]: Without dead ends: 422
[2021-10-28 23:33:43,484 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:33:43,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states.
[2021-10-28 23:33:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380.
[2021-10-28 23:33:43,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 282 states have (on average 1.4326241134751774) internal successors, (404), 306 states have internal predecessors, (404), 71 states have call successors, (71), 28 states have call predecessors, (71), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49)
[2021-10-28 23:33:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 524 transitions.
[2021-10-28 23:33:43,634 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 524 transitions. Word has length 15
[2021-10-28 23:33:43,634 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:33:43,634 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 524 transitions.
[2021-10-28 23:33:43,635 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:33:43,635 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 524 transitions.
[2021-10-28 23:33:43,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2021-10-28 23:33:43,636 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:33:43,636 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:33:43,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-10-28 23:33:43,637 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:33:43,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:33:43,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1971419500, now seen corresponding path program 1 times
[2021-10-28 23:33:43,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:33:43,639 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918428573]
[2021-10-28 23:33:43,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:33:43,639 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:33:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:43,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:33:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:44,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:33:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:44,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:33:44,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:33:44,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918428573]
[2021-10-28 23:33:44,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918428573] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:33:44,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:33:44,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-28 23:33:44,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873262435]
[2021-10-28 23:33:44,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2021-10-28 23:33:44,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:33:44,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-28 23:33:44,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-28 23:33:44,058 INFO L87 Difference]: Start difference. First operand 380 states and 524 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:33:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:33:45,680 INFO L93 Difference]: Finished difference Result 422 states and 586 transitions.
[2021-10-28 23:33:45,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-28 23:33:45,681 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:33:45,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:33:45,687 INFO L225 Difference]: With dead ends: 422
[2021-10-28 23:33:45,687 INFO L226 Difference]: Without dead ends: 422
[2021-10-28 23:33:45,688 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:33:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states.
[2021-10-28 23:33:45,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380.
[2021-10-28 23:33:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 282 states have (on average 1.429078014184397) internal successors, (403), 306 states have internal predecessors, (403), 71 states have call successors, (71), 28 states have call predecessors, (71), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49)
[2021-10-28 23:33:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions.
[2021-10-28 23:33:45,737 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20
[2021-10-28 23:33:45,738 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:33:45,738 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions.
[2021-10-28 23:33:45,739 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:33:45,739 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions.
[2021-10-28 23:33:45,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2021-10-28 23:33:45,741 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:33:45,741 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]
[2021-10-28 23:33:45,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-10-28 23:33:45,742 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:33:45,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:33:45,743 INFO L85 PathProgramCache]: Analyzing trace with hash 809317868, now seen corresponding path program 1 times
[2021-10-28 23:33:45,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:33:45,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375061233]
[2021-10-28 23:33:45,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:33:45,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:33:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:45,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:33:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:46,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:33:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:46,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:33:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:46,065 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:33:46,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:33:46,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375061233]
[2021-10-28 23:33:46,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375061233] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:33:46,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:33:46,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-10-28 23:33:46,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804809971]
[2021-10-28 23:33:46,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-10-28 23:33:46,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:33:46,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-28 23:33:46,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-28 23:33:46,071 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 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:33:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:33:48,066 INFO L93 Difference]: Finished difference Result 585 states and 798 transitions.
[2021-10-28 23:33:48,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-28 23:33:48,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 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 25
[2021-10-28 23:33:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:33:48,077 INFO L225 Difference]: With dead ends: 585
[2021-10-28 23:33:48,078 INFO L226 Difference]: Without dead ends: 584
[2021-10-28 23:33:48,083 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2021-10-28 23:33:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states.
[2021-10-28 23:33:48,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 525.
[2021-10-28 23:33:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 405 states have (on average 1.3530864197530865) internal successors, (548), 410 states have internal predecessors, (548), 78 states have call successors, (78), 41 states have call predecessors, (78), 41 states have return successors, (90), 75 states have call predecessors, (90), 66 states have call successors, (90)
[2021-10-28 23:33:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 716 transitions.
[2021-10-28 23:33:48,136 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 716 transitions. Word has length 25
[2021-10-28 23:33:48,136 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:33:48,136 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 716 transitions.
[2021-10-28 23:33:48,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 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:33:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 716 transitions.
[2021-10-28 23:33:48,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2021-10-28 23:33:48,152 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:33:48,152 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]
[2021-10-28 23:33:48,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-10-28 23:33:48,153 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:33:48,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:33:48,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1577074200, now seen corresponding path program 1 times
[2021-10-28 23:33:48,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:33:48,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538163841]
[2021-10-28 23:33:48,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:33:48,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:33:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:48,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:33:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:48,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:33:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:48,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:33:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:48,472 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:33:48,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:33:48,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538163841]
[2021-10-28 23:33:48,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538163841] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:33:48,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:33:48,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-10-28 23:33:48,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94776423]
[2021-10-28 23:33:48,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-10-28 23:33:48,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:33:48,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-28 23:33:48,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-28 23:33:48,483 INFO L87 Difference]: Start difference. First operand 525 states and 716 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 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:33:49,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:33:49,753 INFO L93 Difference]: Finished difference Result 676 states and 906 transitions.
[2021-10-28 23:33:49,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-28 23:33:49,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 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 31
[2021-10-28 23:33:49,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:33:49,765 INFO L225 Difference]: With dead ends: 676
[2021-10-28 23:33:49,765 INFO L226 Difference]: Without dead ends: 676
[2021-10-28 23:33:49,766 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:33:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states.
[2021-10-28 23:33:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 583.
[2021-10-28 23:33:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 450 states have (on average 1.3488888888888888) internal successors, (607), 463 states have internal predecessors, (607), 82 states have call successors, (82), 46 states have call predecessors, (82), 50 states have return successors, (101), 78 states have call predecessors, (101), 72 states have call successors, (101)
[2021-10-28 23:33:49,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 790 transitions.
[2021-10-28 23:33:49,819 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 790 transitions. Word has length 31
[2021-10-28 23:33:49,819 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:33:49,820 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 790 transitions.
[2021-10-28 23:33:49,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 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:33:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 790 transitions.
[2021-10-28 23:33:49,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2021-10-28 23:33:49,830 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:33:49,830 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]
[2021-10-28 23:33:49,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-10-28 23:33:49,831 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:33:49,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:33:49,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1576156776, now seen corresponding path program 1 times
[2021-10-28 23:33:49,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:33:49,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513679621]
[2021-10-28 23:33:49,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:33:49,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:33:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:50,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:33:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:50,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:33:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:50,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:33:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:50,134 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:33:50,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:33:50,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513679621]
[2021-10-28 23:33:50,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513679621] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:33:50,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:33:50,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-10-28 23:33:50,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869759094]
[2021-10-28 23:33:50,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-10-28 23:33:50,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:33:50,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-28 23:33:50,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-28 23:33:50,139 INFO L87 Difference]: Start difference. First operand 583 states and 790 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 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:33:52,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:33:52,296 INFO L93 Difference]: Finished difference Result 819 states and 1102 transitions.
[2021-10-28 23:33:52,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-28 23:33:52,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 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 33
[2021-10-28 23:33:52,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:33:52,305 INFO L225 Difference]: With dead ends: 819
[2021-10-28 23:33:52,305 INFO L226 Difference]: Without dead ends: 819
[2021-10-28 23:33:52,305 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:33:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states.
[2021-10-28 23:33:52,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 771.
[2021-10-28 23:33:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 606 states have (on average 1.33993399339934) internal successors, (812), 616 states have internal predecessors, (812), 99 states have call successors, (99), 61 states have call predecessors, (99), 65 states have return successors, (136), 97 states have call predecessors, (136), 91 states have call successors, (136)
[2021-10-28 23:33:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1047 transitions.
[2021-10-28 23:33:52,357 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1047 transitions. Word has length 33
[2021-10-28 23:33:52,357 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:33:52,358 INFO L470 AbstractCegarLoop]: Abstraction has 771 states and 1047 transitions.
[2021-10-28 23:33:52,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 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:33:52,358 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1047 transitions.
[2021-10-28 23:33:52,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2021-10-28 23:33:52,362 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:33:52,363 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]
[2021-10-28 23:33:52,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-10-28 23:33:52,363 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:33:52,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:33:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1228281964, now seen corresponding path program 1 times
[2021-10-28 23:33:52,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:33:52,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058704110]
[2021-10-28 23:33:52,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:33:52,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:33:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:52,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:33:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:52,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:33:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:52,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:33:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:52,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:33:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:52,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:33:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:52,659 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:33:52,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:33:52,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058704110]
[2021-10-28 23:33:52,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058704110] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:33:52,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:33:52,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-10-28 23:33:52,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357830442]
[2021-10-28 23:33:52,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-10-28 23:33:52,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:33:52,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-10-28 23:33:52,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2021-10-28 23:33:52,667 INFO L87 Difference]: Start difference. First operand 771 states and 1047 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 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:33:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:33:54,136 INFO L93 Difference]: Finished difference Result 860 states and 1157 transitions.
[2021-10-28 23:33:54,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-10-28 23:33:54,137 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 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 38
[2021-10-28 23:33:54,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:33:54,149 INFO L225 Difference]: With dead ends: 860
[2021-10-28 23:33:54,149 INFO L226 Difference]: Without dead ends: 860
[2021-10-28 23:33:54,149 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:33:54,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states.
[2021-10-28 23:33:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 808.
[2021-10-28 23:33:54,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 636 states have (on average 1.3333333333333333) internal successors, (848), 648 states have internal predecessors, (848), 99 states have call successors, (99), 61 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143)
[2021-10-28 23:33:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1090 transitions.
[2021-10-28 23:33:54,199 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1090 transitions. Word has length 38
[2021-10-28 23:33:54,201 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:33:54,201 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1090 transitions.
[2021-10-28 23:33:54,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 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:33:54,202 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1090 transitions.
[2021-10-28 23:33:54,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2021-10-28 23:33:54,203 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:33:54,204 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]
[2021-10-28 23:33:54,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-10-28 23:33:54,204 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:33:54,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:33:54,205 INFO L85 PathProgramCache]: Analyzing trace with hash 452689020, now seen corresponding path program 1 times
[2021-10-28 23:33:54,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:33:54,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281016191]
[2021-10-28 23:33:54,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:33:54,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:33:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:54,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:33:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:54,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:33:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:54,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:33:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:54,551 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:33:54,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:33:54,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281016191]
[2021-10-28 23:33:54,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281016191] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:33:54,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:33:54,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-10-28 23:33:54,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458917636]
[2021-10-28 23:33:54,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-10-28 23:33:54,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:33:54,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-28 23:33:54,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-28 23:33:54,555 INFO L87 Difference]: Start difference. First operand 808 states and 1090 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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:33:56,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:33:56,049 INFO L93 Difference]: Finished difference Result 839 states and 1128 transitions.
[2021-10-28 23:33:56,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-28 23:33:56,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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 38
[2021-10-28 23:33:56,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:33:56,057 INFO L225 Difference]: With dead ends: 839
[2021-10-28 23:33:56,058 INFO L226 Difference]: Without dead ends: 839
[2021-10-28 23:33:56,058 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:33:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states.
[2021-10-28 23:33:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 819.
[2021-10-28 23:33:56,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3323029366306027) internal successors, (862), 658 states have internal predecessors, (862), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143)
[2021-10-28 23:33:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1104 transitions.
[2021-10-28 23:33:56,102 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1104 transitions. Word has length 38
[2021-10-28 23:33:56,102 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:33:56,103 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1104 transitions.
[2021-10-28 23:33:56,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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:33:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1104 transitions.
[2021-10-28 23:33:56,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2021-10-28 23:33:56,106 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:33:56,106 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]
[2021-10-28 23:33:56,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-10-28 23:33:56,107 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:33:56,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:33:56,108 INFO L85 PathProgramCache]: Analyzing trace with hash -126316899, now seen corresponding path program 1 times
[2021-10-28 23:33:56,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:33:56,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735374187]
[2021-10-28 23:33:56,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:33:56,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:33:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:56,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:33:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:56,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:33:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:56,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:33:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:56,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:33:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:56,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:33:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:56,510 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:33:56,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:33:56,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735374187]
[2021-10-28 23:33:56,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735374187] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:33:56,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:33:56,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:33:56,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189724004]
[2021-10-28 23:33:56,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:33:56,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:33:56,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:33:56,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:33:56,513 INFO L87 Difference]: Start difference. First operand 819 states and 1104 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 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:33:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:33:58,821 INFO L93 Difference]: Finished difference Result 871 states and 1170 transitions.
[2021-10-28 23:33:58,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-10-28 23:33:58,822 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 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 39
[2021-10-28 23:33:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:33:58,829 INFO L225 Difference]: With dead ends: 871
[2021-10-28 23:33:58,829 INFO L226 Difference]: Without dead ends: 871
[2021-10-28 23:33:58,829 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380
[2021-10-28 23:33:58,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states.
[2021-10-28 23:33:58,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819.
[2021-10-28 23:33:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.330757341576507) internal successors, (861), 658 states have internal predecessors, (861), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143)
[2021-10-28 23:33:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1103 transitions.
[2021-10-28 23:33:58,866 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1103 transitions. Word has length 39
[2021-10-28 23:33:58,868 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:33:58,868 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1103 transitions.
[2021-10-28 23:33:58,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 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:33:58,869 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1103 transitions.
[2021-10-28 23:33:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2021-10-28 23:33:58,871 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:33:58,872 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:33:58,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-10-28 23:33:58,872 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:33:58,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:33:58,873 INFO L85 PathProgramCache]: Analyzing trace with hash -481477895, now seen corresponding path program 1 times
[2021-10-28 23:33:58,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:33:58,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380629010]
[2021-10-28 23:33:58,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:33:58,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:33:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:59,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:33:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:59,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:33:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:59,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:33:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:59,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:33:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:59,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:33:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:33:59,238 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:33:59,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:33:59,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380629010]
[2021-10-28 23:33:59,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380629010] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:33:59,239 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:33:59,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:33:59,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720066823]
[2021-10-28 23:33:59,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:33:59,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:33:59,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:33:59,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:33:59,242 INFO L87 Difference]: Start difference. First operand 819 states and 1103 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 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:34:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:01,627 INFO L93 Difference]: Finished difference Result 871 states and 1169 transitions.
[2021-10-28 23:34:01,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-10-28 23:34:01,628 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 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 40
[2021-10-28 23:34:01,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:01,635 INFO L225 Difference]: With dead ends: 871
[2021-10-28 23:34:01,635 INFO L226 Difference]: Without dead ends: 871
[2021-10-28 23:34:01,636 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380
[2021-10-28 23:34:01,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states.
[2021-10-28 23:34:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819.
[2021-10-28 23:34:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3292117465224111) internal successors, (860), 658 states have internal predecessors, (860), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143)
[2021-10-28 23:34:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1102 transitions.
[2021-10-28 23:34:01,674 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1102 transitions. Word has length 40
[2021-10-28 23:34:01,674 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:01,674 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1102 transitions.
[2021-10-28 23:34:01,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 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:34:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1102 transitions.
[2021-10-28 23:34:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2021-10-28 23:34:01,676 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:01,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]
[2021-10-28 23:34:01,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-10-28 23:34:01,677 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:01,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:01,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1957366842, now seen corresponding path program 1 times
[2021-10-28 23:34:01,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:01,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689324535]
[2021-10-28 23:34:01,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:01,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:01,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:01,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:01,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:01,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:34:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:02,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:34:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:02,027 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:34:02,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:02,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689324535]
[2021-10-28 23:34:02,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689324535] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:02,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:02,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-10-28 23:34:02,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627047153]
[2021-10-28 23:34:02,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-10-28 23:34:02,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:02,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-10-28 23:34:02,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:34:02,031 INFO L87 Difference]: Start difference. First operand 819 states and 1102 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 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:34:04,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:04,025 INFO L93 Difference]: Finished difference Result 879 states and 1177 transitions.
[2021-10-28 23:34:04,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-10-28 23:34:04,026 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 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:34:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:04,038 INFO L225 Difference]: With dead ends: 879
[2021-10-28 23:34:04,039 INFO L226 Difference]: Without dead ends: 867
[2021-10-28 23:34:04,039 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:34:04,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states.
[2021-10-28 23:34:04,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 817.
[2021-10-28 23:34:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 646 states have (on average 1.328173374613003) internal successors, (858), 657 states have internal predecessors, (858), 98 states have call successors, (98), 62 states have call predecessors, (98), 72 states have return successors, (142), 99 states have call predecessors, (142), 90 states have call successors, (142)
[2021-10-28 23:34:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1098 transitions.
[2021-10-28 23:34:04,082 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1098 transitions. Word has length 41
[2021-10-28 23:34:04,082 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:04,083 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1098 transitions.
[2021-10-28 23:34:04,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 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:34:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1098 transitions.
[2021-10-28 23:34:04,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2021-10-28 23:34:04,085 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:04,086 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:34:04,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-10-28 23:34:04,087 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:04,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:04,087 INFO L85 PathProgramCache]: Analyzing trace with hash -884481493, now seen corresponding path program 1 times
[2021-10-28 23:34:04,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:04,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545888734]
[2021-10-28 23:34:04,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:04,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:04,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:04,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:04,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:04,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2021-10-28 23:34:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:04,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:34:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:04,386 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:34:04,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:04,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545888734]
[2021-10-28 23:34:04,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545888734] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:04,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:04,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-10-28 23:34:04,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688499542]
[2021-10-28 23:34:04,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-10-28 23:34:04,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:04,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-10-28 23:34:04,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:34:04,389 INFO L87 Difference]: Start difference. First operand 817 states and 1098 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 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:34:06,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:06,438 INFO L93 Difference]: Finished difference Result 877 states and 1173 transitions.
[2021-10-28 23:34:06,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-10-28 23:34:06,439 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 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 42
[2021-10-28 23:34:06,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:06,446 INFO L225 Difference]: With dead ends: 877
[2021-10-28 23:34:06,446 INFO L226 Difference]: Without dead ends: 860
[2021-10-28 23:34:06,447 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:34:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states.
[2021-10-28 23:34:06,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 810.
[2021-10-28 23:34:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 642 states have (on average 1.3286604361370717) internal successors, (853), 653 states have internal predecessors, (853), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140)
[2021-10-28 23:34:06,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1089 transitions.
[2021-10-28 23:34:06,484 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1089 transitions. Word has length 42
[2021-10-28 23:34:06,485 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:06,485 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 1089 transitions.
[2021-10-28 23:34:06,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 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:34:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1089 transitions.
[2021-10-28 23:34:06,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2021-10-28 23:34:06,488 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:06,488 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:34:06,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-10-28 23:34:06,489 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:06,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:06,490 INFO L85 PathProgramCache]: Analyzing trace with hash -586304541, now seen corresponding path program 1 times
[2021-10-28 23:34:06,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:06,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661837400]
[2021-10-28 23:34:06,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:06,491 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:06,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:06,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:06,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:06,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:34:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:06,746 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:34:06,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:06,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661837400]
[2021-10-28 23:34:06,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661837400] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:06,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:06,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-10-28 23:34:06,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759015333]
[2021-10-28 23:34:06,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-10-28 23:34:06,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:06,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-10-28 23:34:06,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2021-10-28 23:34:06,750 INFO L87 Difference]: Start difference. First operand 810 states and 1089 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4)
[2021-10-28 23:34:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:08,081 INFO L93 Difference]: Finished difference Result 835 states and 1118 transitions.
[2021-10-28 23:34:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-10-28 23:34:08,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42
[2021-10-28 23:34:08,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:08,088 INFO L225 Difference]: With dead ends: 835
[2021-10-28 23:34:08,089 INFO L226 Difference]: Without dead ends: 835
[2021-10-28 23:34:08,089 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:34:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states.
[2021-10-28 23:34:08,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 812.
[2021-10-28 23:34:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 644 states have (on average 1.3276397515527951) internal successors, (855), 655 states have internal predecessors, (855), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140)
[2021-10-28 23:34:08,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1091 transitions.
[2021-10-28 23:34:08,121 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1091 transitions. Word has length 42
[2021-10-28 23:34:08,122 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:08,122 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1091 transitions.
[2021-10-28 23:34:08,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4)
[2021-10-28 23:34:08,122 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1091 transitions.
[2021-10-28 23:34:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2021-10-28 23:34:08,124 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:08,124 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:34:08,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-10-28 23:34:08,125 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:08,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:08,125 INFO L85 PathProgramCache]: Analyzing trace with hash -211337402, now seen corresponding path program 1 times
[2021-10-28 23:34:08,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:08,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745909602]
[2021-10-28 23:34:08,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:08,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:08,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:08,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:08,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:08,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2021-10-28 23:34:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:08,375 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:34:08,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:08,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745909602]
[2021-10-28 23:34:08,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745909602] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:08,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:08,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-10-28 23:34:08,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813864787]
[2021-10-28 23:34:08,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2021-10-28 23:34:08,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:08,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-10-28 23:34:08,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2021-10-28 23:34:08,379 INFO L87 Difference]: Start difference. First operand 812 states and 1091 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 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:34:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:10,416 INFO L93 Difference]: Finished difference Result 840 states and 1124 transitions.
[2021-10-28 23:34:10,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-10-28 23:34:10,418 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 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 44
[2021-10-28 23:34:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:10,424 INFO L225 Difference]: With dead ends: 840
[2021-10-28 23:34:10,425 INFO L226 Difference]: Without dead ends: 840
[2021-10-28 23:34:10,425 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:34:10,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states.
[2021-10-28 23:34:10,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 816.
[2021-10-28 23:34:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142)
[2021-10-28 23:34:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions.
[2021-10-28 23:34:10,464 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 44
[2021-10-28 23:34:10,464 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:10,465 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions.
[2021-10-28 23:34:10,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 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:34:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions.
[2021-10-28 23:34:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2021-10-28 23:34:10,467 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:10,467 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:34:10,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-10-28 23:34:10,468 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:10,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:10,468 INFO L85 PathProgramCache]: Analyzing trace with hash 114455309, now seen corresponding path program 1 times
[2021-10-28 23:34:10,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:10,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526993810]
[2021-10-28 23:34:10,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:10,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:10,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:10,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:10,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:10,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:34:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:10,757 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:34:10,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:10,758 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526993810]
[2021-10-28 23:34:10,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526993810] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:10,758 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:10,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-10-28 23:34:10,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260680259]
[2021-10-28 23:34:10,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-10-28 23:34:10,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:10,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-10-28 23:34:10,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2021-10-28 23:34:10,762 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4)
[2021-10-28 23:34:12,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:12,152 INFO L93 Difference]: Finished difference Result 838 states and 1121 transitions.
[2021-10-28 23:34:12,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-10-28 23:34:12,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43
[2021-10-28 23:34:12,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:12,159 INFO L225 Difference]: With dead ends: 838
[2021-10-28 23:34:12,159 INFO L226 Difference]: Without dead ends: 838
[2021-10-28 23:34:12,160 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156
[2021-10-28 23:34:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states.
[2021-10-28 23:34:12,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 816.
[2021-10-28 23:34:12,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142)
[2021-10-28 23:34:12,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions.
[2021-10-28 23:34:12,192 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 43
[2021-10-28 23:34:12,194 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:12,194 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions.
[2021-10-28 23:34:12,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4)
[2021-10-28 23:34:12,194 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions.
[2021-10-28 23:34:12,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2021-10-28 23:34:12,197 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:12,198 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:34:12,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-10-28 23:34:12,198 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:12,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:12,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1730277995, now seen corresponding path program 1 times
[2021-10-28 23:34:12,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:12,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66222825]
[2021-10-28 23:34:12,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:12,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:12,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:12,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:12,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:12,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:34:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:12,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2021-10-28 23:34:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:12,498 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:34:12,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:12,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66222825]
[2021-10-28 23:34:12,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66222825] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:12,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:12,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-10-28 23:34:12,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470466962]
[2021-10-28 23:34:12,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-10-28 23:34:12,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:12,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-10-28 23:34:12,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:34:12,501 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 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:34:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:14,059 INFO L93 Difference]: Finished difference Result 858 states and 1146 transitions.
[2021-10-28 23:34:14,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-10-28 23:34:14,060 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 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 45
[2021-10-28 23:34:14,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:14,066 INFO L225 Difference]: With dead ends: 858
[2021-10-28 23:34:14,067 INFO L226 Difference]: Without dead ends: 843
[2021-10-28 23:34:14,067 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:34:14,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states.
[2021-10-28 23:34:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 814.
[2021-10-28 23:34:14,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 646 states have (on average 1.325077399380805) internal successors, (856), 657 states have internal predecessors, (856), 95 states have call successors, (95), 61 states have call predecessors, (95), 72 states have return successors, (141), 97 states have call predecessors, (141), 87 states have call successors, (141)
[2021-10-28 23:34:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1092 transitions.
[2021-10-28 23:34:14,103 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1092 transitions. Word has length 45
[2021-10-28 23:34:14,104 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:14,104 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1092 transitions.
[2021-10-28 23:34:14,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 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:34:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1092 transitions.
[2021-10-28 23:34:14,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2021-10-28 23:34:14,106 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:14,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]
[2021-10-28 23:34:14,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-10-28 23:34:14,107 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:14,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:14,108 INFO L85 PathProgramCache]: Analyzing trace with hash -645503113, now seen corresponding path program 1 times
[2021-10-28 23:34:14,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:14,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839568948]
[2021-10-28 23:34:14,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:14,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:14,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:14,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:14,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:14,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:34:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:14,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2021-10-28 23:34:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:14,382 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:34:14,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:14,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839568948]
[2021-10-28 23:34:14,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839568948] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:14,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:14,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-10-28 23:34:14,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507534879]
[2021-10-28 23:34:14,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-10-28 23:34:14,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:14,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-10-28 23:34:14,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2021-10-28 23:34:14,390 INFO L87 Difference]: Start difference. First operand 814 states and 1092 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 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:34:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:16,103 INFO L93 Difference]: Finished difference Result 855 states and 1136 transitions.
[2021-10-28 23:34:16,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2021-10-28 23:34:16,103 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 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 46
[2021-10-28 23:34:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:16,109 INFO L225 Difference]: With dead ends: 855
[2021-10-28 23:34:16,109 INFO L226 Difference]: Without dead ends: 804
[2021-10-28 23:34:16,110 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2021-10-28 23:34:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states.
[2021-10-28 23:34:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 775.
[2021-10-28 23:34:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 616 states have (on average 1.3246753246753247) internal successors, (816), 628 states have internal predecessors, (816), 93 states have call successors, (93), 60 states have call predecessors, (93), 65 states have return successors, (132), 88 states have call predecessors, (132), 85 states have call successors, (132)
[2021-10-28 23:34:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions.
[2021-10-28 23:34:16,140 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 46
[2021-10-28 23:34:16,140 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:16,140 INFO L470 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions.
[2021-10-28 23:34:16,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 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:34:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions.
[2021-10-28 23:34:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2021-10-28 23:34:16,142 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:16,143 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]
[2021-10-28 23:34:16,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-10-28 23:34:16,143 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:16,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:16,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1178138073, now seen corresponding path program 1 times
[2021-10-28 23:34:16,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:16,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010635315]
[2021-10-28 23:34:16,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:16,145 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:16,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:16,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:16,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:16,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2021-10-28 23:34:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:16,405 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:34:16,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:16,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010635315]
[2021-10-28 23:34:16,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010635315] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:16,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:16,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-10-28 23:34:16,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986912368]
[2021-10-28 23:34:16,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2021-10-28 23:34:16,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:16,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-10-28 23:34:16,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2021-10-28 23:34:16,409 INFO L87 Difference]: Start difference. First operand 775 states and 1041 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 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:34:18,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:18,269 INFO L93 Difference]: Finished difference Result 1131 states and 1528 transitions.
[2021-10-28 23:34:18,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-10-28 23:34:18,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 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 47
[2021-10-28 23:34:18,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:18,277 INFO L225 Difference]: With dead ends: 1131
[2021-10-28 23:34:18,277 INFO L226 Difference]: Without dead ends: 1131
[2021-10-28 23:34:18,278 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:34:18,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states.
[2021-10-28 23:34:18,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 888.
[2021-10-28 23:34:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 707 states have (on average 1.3295615275813295) internal successors, (940), 721 states have internal predecessors, (940), 103 states have call successors, (103), 70 states have call predecessors, (103), 77 states have return successors, (152), 98 states have call predecessors, (152), 95 states have call successors, (152)
[2021-10-28 23:34:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1195 transitions.
[2021-10-28 23:34:18,319 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1195 transitions. Word has length 47
[2021-10-28 23:34:18,319 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:18,320 INFO L470 AbstractCegarLoop]: Abstraction has 888 states and 1195 transitions.
[2021-10-28 23:34:18,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 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:34:18,320 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1195 transitions.
[2021-10-28 23:34:18,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2021-10-28 23:34:18,322 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:18,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]
[2021-10-28 23:34:18,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2021-10-28 23:34:18,323 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:18,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1451715450, now seen corresponding path program 1 times
[2021-10-28 23:34:18,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:18,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890352599]
[2021-10-28 23:34:18,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:18,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:18,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:18,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:18,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:18,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:34:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:18,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:34:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:18,584 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:34:18,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:18,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890352599]
[2021-10-28 23:34:18,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890352599] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:18,585 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:18,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-10-28 23:34:18,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386030023]
[2021-10-28 23:34:18,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-10-28 23:34:18,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:18,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-10-28 23:34:18,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:34:18,590 INFO L87 Difference]: Start difference. First operand 888 states and 1195 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 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:34:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:19,819 INFO L93 Difference]: Finished difference Result 930 states and 1245 transitions.
[2021-10-28 23:34:19,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2021-10-28 23:34:19,820 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 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 47
[2021-10-28 23:34:19,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:19,825 INFO L225 Difference]: With dead ends: 930
[2021-10-28 23:34:19,825 INFO L226 Difference]: Without dead ends: 915
[2021-10-28 23:34:19,826 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:34:19,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states.
[2021-10-28 23:34:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 886.
[2021-10-28 23:34:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 706 states have (on average 1.3286118980169972) internal successors, (938), 720 states have internal predecessors, (938), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151)
[2021-10-28 23:34:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1191 transitions.
[2021-10-28 23:34:19,854 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1191 transitions. Word has length 47
[2021-10-28 23:34:19,854 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:19,855 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 1191 transitions.
[2021-10-28 23:34:19,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 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:34:19,855 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1191 transitions.
[2021-10-28 23:34:19,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2021-10-28 23:34:19,856 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:19,857 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]
[2021-10-28 23:34:19,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2021-10-28 23:34:19,857 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:19,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:19,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1924484230, now seen corresponding path program 1 times
[2021-10-28 23:34:19,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:19,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690445510]
[2021-10-28 23:34:19,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:19,858 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:20,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:20,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:20,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:20,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2021-10-28 23:34:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:20,203 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:34:20,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:20,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690445510]
[2021-10-28 23:34:20,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690445510] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:20,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:20,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-10-28 23:34:20,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533553044]
[2021-10-28 23:34:20,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-10-28 23:34:20,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:20,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-10-28 23:34:20,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:34:20,210 INFO L87 Difference]: Start difference. First operand 886 states and 1191 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 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:34:22,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:22,692 INFO L93 Difference]: Finished difference Result 936 states and 1237 transitions.
[2021-10-28 23:34:22,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:34:22,692 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 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 48
[2021-10-28 23:34:22,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:22,697 INFO L225 Difference]: With dead ends: 936
[2021-10-28 23:34:22,697 INFO L226 Difference]: Without dead ends: 936
[2021-10-28 23:34:22,698 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272
[2021-10-28 23:34:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states.
[2021-10-28 23:34:22,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 877.
[2021-10-28 23:34:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 697 states have (on average 1.3156384505021521) internal successors, (917), 711 states have internal predecessors, (917), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151)
[2021-10-28 23:34:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1170 transitions.
[2021-10-28 23:34:22,730 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1170 transitions. Word has length 48
[2021-10-28 23:34:22,730 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:22,730 INFO L470 AbstractCegarLoop]: Abstraction has 877 states and 1170 transitions.
[2021-10-28 23:34:22,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 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:34:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1170 transitions.
[2021-10-28 23:34:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2021-10-28 23:34:22,733 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:22,733 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]
[2021-10-28 23:34:22,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2021-10-28 23:34:22,733 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:22,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:22,734 INFO L85 PathProgramCache]: Analyzing trace with hash -398461437, now seen corresponding path program 1 times
[2021-10-28 23:34:22,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:22,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080635188]
[2021-10-28 23:34:22,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:22,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:22,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:22,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:22,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:22,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:34:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:23,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:23,062 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:34:23,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:23,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080635188]
[2021-10-28 23:34:23,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080635188] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:23,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:23,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:34:23,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363870262]
[2021-10-28 23:34:23,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:34:23,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:23,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:34:23,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:34:23,066 INFO L87 Difference]: Start difference. First operand 877 states and 1170 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 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:34:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:25,826 INFO L93 Difference]: Finished difference Result 1075 states and 1432 transitions.
[2021-10-28 23:34:25,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2021-10-28 23:34:25,827 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 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 50
[2021-10-28 23:34:25,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:25,843 INFO L225 Difference]: With dead ends: 1075
[2021-10-28 23:34:25,843 INFO L226 Difference]: Without dead ends: 1075
[2021-10-28 23:34:25,844 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756
[2021-10-28 23:34:25,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states.
[2021-10-28 23:34:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 932.
[2021-10-28 23:34:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.3090418353576248) internal successors, (970), 757 states have internal predecessors, (970), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168)
[2021-10-28 23:34:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1243 transitions.
[2021-10-28 23:34:25,879 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1243 transitions. Word has length 50
[2021-10-28 23:34:25,879 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:25,879 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1243 transitions.
[2021-10-28 23:34:25,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 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:34:25,880 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1243 transitions.
[2021-10-28 23:34:25,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2021-10-28 23:34:25,882 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:25,882 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]
[2021-10-28 23:34:25,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2021-10-28 23:34:25,883 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:25,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:25,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1946804572, now seen corresponding path program 1 times
[2021-10-28 23:34:25,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:25,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515545444]
[2021-10-28 23:34:25,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:25,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:26,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:26,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:26,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:26,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:34:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:26,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2021-10-28 23:34:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:26,177 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:34:26,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:26,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515545444]
[2021-10-28 23:34:26,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515545444] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:26,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:26,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-10-28 23:34:26,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718877779]
[2021-10-28 23:34:26,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2021-10-28 23:34:26,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:26,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-10-28 23:34:26,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2021-10-28 23:34:26,182 INFO L87 Difference]: Start difference. First operand 932 states and 1243 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2021-10-28 23:34:27,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:27,628 INFO L93 Difference]: Finished difference Result 976 states and 1293 transitions.
[2021-10-28 23:34:27,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:34:27,629 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50
[2021-10-28 23:34:27,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:27,635 INFO L225 Difference]: With dead ends: 976
[2021-10-28 23:34:27,635 INFO L226 Difference]: Without dead ends: 959
[2021-10-28 23:34:27,635 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:34:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states.
[2021-10-28 23:34:27,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 932.
[2021-10-28 23:34:27,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.2928475033738192) internal successors, (958), 757 states have internal predecessors, (958), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168)
[2021-10-28 23:34:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1231 transitions.
[2021-10-28 23:34:27,668 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1231 transitions. Word has length 50
[2021-10-28 23:34:27,668 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:27,668 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1231 transitions.
[2021-10-28 23:34:27,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2021-10-28 23:34:27,669 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1231 transitions.
[2021-10-28 23:34:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2021-10-28 23:34:27,671 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:27,671 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:34:27,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2021-10-28 23:34:27,671 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:27,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:27,672 INFO L85 PathProgramCache]: Analyzing trace with hash 764937325, now seen corresponding path program 1 times
[2021-10-28 23:34:27,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:27,672 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719295489]
[2021-10-28 23:34:27,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:27,673 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:27,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:27,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:27,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:27,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2021-10-28 23:34:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:27,912 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:34:27,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:27,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719295489]
[2021-10-28 23:34:27,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719295489] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:27,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:27,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-10-28 23:34:27,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620784507]
[2021-10-28 23:34:27,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-10-28 23:34:27,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:27,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-10-28 23:34:27,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2021-10-28 23:34:27,915 INFO L87 Difference]: Start difference. First operand 932 states and 1231 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 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:34:29,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:29,210 INFO L93 Difference]: Finished difference Result 685 states and 869 transitions.
[2021-10-28 23:34:29,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-10-28 23:34:29,211 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 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 52
[2021-10-28 23:34:29,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:29,216 INFO L225 Difference]: With dead ends: 685
[2021-10-28 23:34:29,216 INFO L226 Difference]: Without dead ends: 685
[2021-10-28 23:34:29,216 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156
[2021-10-28 23:34:29,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states.
[2021-10-28 23:34:29,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 623.
[2021-10-28 23:34:29,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 498 states have (on average 1.2751004016064258) internal successors, (635), 509 states have internal predecessors, (635), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 68 states have call predecessors, (85), 63 states have call successors, (85)
[2021-10-28 23:34:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 791 transitions.
[2021-10-28 23:34:29,239 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 791 transitions. Word has length 52
[2021-10-28 23:34:29,240 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:29,240 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 791 transitions.
[2021-10-28 23:34:29,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 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:34:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 791 transitions.
[2021-10-28 23:34:29,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2021-10-28 23:34:29,242 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:29,242 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]
[2021-10-28 23:34:29,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2021-10-28 23:34:29,243 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:29,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:29,244 INFO L85 PathProgramCache]: Analyzing trace with hash 855475542, now seen corresponding path program 1 times
[2021-10-28 23:34:29,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:29,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054543139]
[2021-10-28 23:34:29,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:29,245 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:29,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:29,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:29,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:29,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:34:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:29,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:34:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:29,542 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:34:29,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:29,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054543139]
[2021-10-28 23:34:29,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054543139] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:29,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:29,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-10-28 23:34:29,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821417301]
[2021-10-28 23:34:29,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2021-10-28 23:34:29,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:29,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-10-28 23:34:29,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2021-10-28 23:34:29,548 INFO L87 Difference]: Start difference. First operand 623 states and 791 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 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:34:31,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:31,811 INFO L93 Difference]: Finished difference Result 659 states and 834 transitions.
[2021-10-28 23:34:31,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-10-28 23:34:31,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 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 51
[2021-10-28 23:34:31,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:31,815 INFO L225 Difference]: With dead ends: 659
[2021-10-28 23:34:31,815 INFO L226 Difference]: Without dead ends: 659
[2021-10-28 23:34:31,815 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306
[2021-10-28 23:34:31,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states.
[2021-10-28 23:34:31,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 624.
[2021-10-28 23:34:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 499 states have (on average 1.2745490981963927) internal successors, (636), 509 states have internal predecessors, (636), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85)
[2021-10-28 23:34:31,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 792 transitions.
[2021-10-28 23:34:31,841 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 792 transitions. Word has length 51
[2021-10-28 23:34:31,842 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:31,842 INFO L470 AbstractCegarLoop]: Abstraction has 624 states and 792 transitions.
[2021-10-28 23:34:31,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 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:34:31,842 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 792 transitions.
[2021-10-28 23:34:31,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2021-10-28 23:34:31,845 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:31,846 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]
[2021-10-28 23:34:31,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2021-10-28 23:34:31,846 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:31,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:31,847 INFO L85 PathProgramCache]: Analyzing trace with hash -69609850, now seen corresponding path program 1 times
[2021-10-28 23:34:31,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:31,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074503988]
[2021-10-28 23:34:31,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:31,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:32,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:32,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:32,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:32,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:34:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:32,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:34:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:32,178 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:34:32,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:32,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074503988]
[2021-10-28 23:34:32,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074503988] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:32,179 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:32,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-10-28 23:34:32,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508502245]
[2021-10-28 23:34:32,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2021-10-28 23:34:32,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:32,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-10-28 23:34:32,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2021-10-28 23:34:32,181 INFO L87 Difference]: Start difference. First operand 624 states and 792 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2021-10-28 23:34:33,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:33,670 INFO L93 Difference]: Finished difference Result 673 states and 848 transitions.
[2021-10-28 23:34:33,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:34:33,671 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51
[2021-10-28 23:34:33,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:33,674 INFO L225 Difference]: With dead ends: 673
[2021-10-28 23:34:33,674 INFO L226 Difference]: Without dead ends: 648
[2021-10-28 23:34:33,675 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210
[2021-10-28 23:34:33,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states.
[2021-10-28 23:34:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 616.
[2021-10-28 23:34:33,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 491 states have (on average 1.2688391038696538) internal successors, (623), 501 states have internal predecessors, (623), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85)
[2021-10-28 23:34:33,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 779 transitions.
[2021-10-28 23:34:33,696 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 779 transitions. Word has length 51
[2021-10-28 23:34:33,696 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:33,696 INFO L470 AbstractCegarLoop]: Abstraction has 616 states and 779 transitions.
[2021-10-28 23:34:33,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2021-10-28 23:34:33,697 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 779 transitions.
[2021-10-28 23:34:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2021-10-28 23:34:33,698 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:33,699 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:34:33,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2021-10-28 23:34:33,699 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:33,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:33,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1297164280, now seen corresponding path program 1 times
[2021-10-28 23:34:33,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:33,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866234102]
[2021-10-28 23:34:33,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:33,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:33,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:33,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:33,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:33,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:34:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:33,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:33,956 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:34:33,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:33,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866234102]
[2021-10-28 23:34:33,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866234102] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:33,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:33,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-10-28 23:34:33,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796580985]
[2021-10-28 23:34:33,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-10-28 23:34:33,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:33,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-10-28 23:34:33,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2021-10-28 23:34:33,982 INFO L87 Difference]: Start difference. First operand 616 states and 779 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 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:34:35,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:35,492 INFO L93 Difference]: Finished difference Result 850 states and 1092 transitions.
[2021-10-28 23:34:35,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-10-28 23:34:35,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 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 52
[2021-10-28 23:34:35,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:35,498 INFO L225 Difference]: With dead ends: 850
[2021-10-28 23:34:35,499 INFO L226 Difference]: Without dead ends: 832
[2021-10-28 23:34:35,499 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:34:35,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states.
[2021-10-28 23:34:35,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 659.
[2021-10-28 23:34:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 527 states have (on average 1.2580645161290323) internal successors, (663), 530 states have internal predecessors, (663), 73 states have call successors, (73), 48 states have call predecessors, (73), 58 states have return successors, (97), 81 states have call predecessors, (97), 65 states have call successors, (97)
[2021-10-28 23:34:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 833 transitions.
[2021-10-28 23:34:35,535 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 833 transitions. Word has length 52
[2021-10-28 23:34:35,535 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:35,535 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 833 transitions.
[2021-10-28 23:34:35,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 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:34:35,537 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 833 transitions.
[2021-10-28 23:34:35,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2021-10-28 23:34:35,538 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:35,539 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:34:35,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2021-10-28 23:34:35,539 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:35,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash 147904264, now seen corresponding path program 1 times
[2021-10-28 23:34:35,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:35,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417118074]
[2021-10-28 23:34:35,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:35,541 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:35,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:35,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:35,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:35,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:34:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:35,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:35,811 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:34:35,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:35,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417118074]
[2021-10-28 23:34:35,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417118074] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:35,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:35,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-10-28 23:34:35,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153307929]
[2021-10-28 23:34:35,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-10-28 23:34:35,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:35,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-10-28 23:34:35,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2021-10-28 23:34:35,815 INFO L87 Difference]: Start difference. First operand 659 states and 833 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 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:34:37,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:37,043 INFO L93 Difference]: Finished difference Result 719 states and 923 transitions.
[2021-10-28 23:34:37,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2021-10-28 23:34:37,045 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 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 52
[2021-10-28 23:34:37,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:37,049 INFO L225 Difference]: With dead ends: 719
[2021-10-28 23:34:37,050 INFO L226 Difference]: Without dead ends: 714
[2021-10-28 23:34:37,050 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72
[2021-10-28 23:34:37,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states.
[2021-10-28 23:34:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 666.
[2021-10-28 23:34:37,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 534 states have (on average 1.2602996254681649) internal successors, (673), 537 states have internal predecessors, (673), 73 states have call successors, (73), 48 states have call predecessors, (73), 58 states have return successors, (97), 81 states have call predecessors, (97), 65 states have call successors, (97)
[2021-10-28 23:34:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 843 transitions.
[2021-10-28 23:34:37,075 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 843 transitions. Word has length 52
[2021-10-28 23:34:37,075 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:37,075 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 843 transitions.
[2021-10-28 23:34:37,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 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:34:37,076 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 843 transitions.
[2021-10-28 23:34:37,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2021-10-28 23:34:37,078 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:37,078 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:34:37,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2021-10-28 23:34:37,078 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:37,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:37,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1440443638, now seen corresponding path program 1 times
[2021-10-28 23:34:37,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:37,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294984505]
[2021-10-28 23:34:37,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:37,080 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:37,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:37,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:37,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:37,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:34:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:37,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:37,430 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:34:37,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:37,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294984505]
[2021-10-28 23:34:37,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294984505] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:37,431 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:37,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:34:37,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612020525]
[2021-10-28 23:34:37,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:34:37,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:37,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:34:37,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:34:37,433 INFO L87 Difference]: Start difference. First operand 666 states and 843 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:34:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:39,486 INFO L93 Difference]: Finished difference Result 652 states and 822 transitions.
[2021-10-28 23:34:39,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2021-10-28 23:34:39,486 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:34:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:39,489 INFO L225 Difference]: With dead ends: 652
[2021-10-28 23:34:39,489 INFO L226 Difference]: Without dead ends: 610
[2021-10-28 23:34:39,490 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506
[2021-10-28 23:34:39,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states.
[2021-10-28 23:34:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 575.
[2021-10-28 23:34:39,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 455 states have (on average 1.2747252747252746) internal successors, (580), 465 states have internal predecessors, (580), 69 states have call successors, (69), 44 states have call predecessors, (69), 50 states have return successors, (82), 66 states have call predecessors, (82), 61 states have call successors, (82)
[2021-10-28 23:34:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 731 transitions.
[2021-10-28 23:34:39,508 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 731 transitions. Word has length 52
[2021-10-28 23:34:39,509 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:39,509 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 731 transitions.
[2021-10-28 23:34:39,509 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:34:39,510 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 731 transitions.
[2021-10-28 23:34:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2021-10-28 23:34:39,511 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:39,512 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]
[2021-10-28 23:34:39,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2021-10-28 23:34:39,512 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:39,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:39,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1105462305, now seen corresponding path program 1 times
[2021-10-28 23:34:39,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:39,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274738475]
[2021-10-28 23:34:39,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:39,514 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:39,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:39,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:39,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:39,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:34:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:39,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:39,852 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:34:39,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:39,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274738475]
[2021-10-28 23:34:39,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274738475] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:39,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:39,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-10-28 23:34:39,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205451472]
[2021-10-28 23:34:39,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2021-10-28 23:34:39,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:39,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-10-28 23:34:39,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156
[2021-10-28 23:34:39,855 INFO L87 Difference]: Start difference. First operand 575 states and 731 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 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:34:41,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:41,854 INFO L93 Difference]: Finished difference Result 606 states and 767 transitions.
[2021-10-28 23:34:41,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:34:41,864 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 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 53
[2021-10-28 23:34:41,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:41,868 INFO L225 Difference]: With dead ends: 606
[2021-10-28 23:34:41,868 INFO L226 Difference]: Without dead ends: 605
[2021-10-28 23:34:41,868 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:34:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states.
[2021-10-28 23:34:41,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 583.
[2021-10-28 23:34:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 462 states have (on average 1.2705627705627707) internal successors, (587), 472 states have internal predecessors, (587), 69 states have call successors, (69), 44 states have call predecessors, (69), 51 states have return successors, (83), 67 states have call predecessors, (83), 61 states have call successors, (83)
[2021-10-28 23:34:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 739 transitions.
[2021-10-28 23:34:41,886 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 739 transitions. Word has length 53
[2021-10-28 23:34:41,886 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:41,886 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 739 transitions.
[2021-10-28 23:34:41,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 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:34:41,887 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 739 transitions.
[2021-10-28 23:34:41,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2021-10-28 23:34:41,889 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:41,889 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]
[2021-10-28 23:34:41,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2021-10-28 23:34:41,890 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:41,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:41,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1105739135, now seen corresponding path program 1 times
[2021-10-28 23:34:41,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:41,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346724376]
[2021-10-28 23:34:41,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:41,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:42,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:42,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:42,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:42,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:34:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:42,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:42,296 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:34:42,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:42,296 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346724376]
[2021-10-28 23:34:42,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346724376] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:42,297 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:42,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-10-28 23:34:42,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554884156]
[2021-10-28 23:34:42,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2021-10-28 23:34:42,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:42,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-10-28 23:34:42,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156
[2021-10-28 23:34:42,303 INFO L87 Difference]: Start difference. First operand 583 states and 739 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 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:34:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:43,800 INFO L93 Difference]: Finished difference Result 641 states and 820 transitions.
[2021-10-28 23:34:43,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-10-28 23:34:43,801 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 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 53
[2021-10-28 23:34:43,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:43,806 INFO L225 Difference]: With dead ends: 641
[2021-10-28 23:34:43,806 INFO L226 Difference]: Without dead ends: 629
[2021-10-28 23:34:43,807 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240
[2021-10-28 23:34:43,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states.
[2021-10-28 23:34:43,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 589.
[2021-10-28 23:34:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 467 states have (on average 1.2676659528907923) internal successors, (592), 478 states have internal predecessors, (592), 69 states have call successors, (69), 44 states have call predecessors, (69), 52 states have return successors, (90), 67 states have call predecessors, (90), 61 states have call successors, (90)
[2021-10-28 23:34:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 751 transitions.
[2021-10-28 23:34:43,827 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 751 transitions. Word has length 53
[2021-10-28 23:34:43,827 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:43,828 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 751 transitions.
[2021-10-28 23:34:43,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 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:34:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 751 transitions.
[2021-10-28 23:34:43,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2021-10-28 23:34:43,830 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:43,830 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:34:43,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2021-10-28 23:34:43,831 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:43,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:43,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1185659497, now seen corresponding path program 1 times
[2021-10-28 23:34:43,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:43,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523968302]
[2021-10-28 23:34:43,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:43,832 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:43,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:44,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:44,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:44,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:34:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:44,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:44,142 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:34:44,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:44,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523968302]
[2021-10-28 23:34:44,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523968302] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:44,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:44,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-10-28 23:34:44,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971735594]
[2021-10-28 23:34:44,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-10-28 23:34:44,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:44,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-10-28 23:34:44,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:34:44,146 INFO L87 Difference]: Start difference. First operand 589 states and 751 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 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:34:47,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:47,327 INFO L93 Difference]: Finished difference Result 754 states and 980 transitions.
[2021-10-28 23:34:47,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2021-10-28 23:34:47,328 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 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 54
[2021-10-28 23:34:47,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:47,331 INFO L225 Difference]: With dead ends: 754
[2021-10-28 23:34:47,332 INFO L226 Difference]: Without dead ends: 740
[2021-10-28 23:34:47,332 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380
[2021-10-28 23:34:47,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states.
[2021-10-28 23:34:47,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 573.
[2021-10-28 23:34:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 454 states have (on average 1.2731277533039647) internal successors, (578), 464 states have internal predecessors, (578), 68 states have call successors, (68), 44 states have call predecessors, (68), 50 states have return successors, (81), 65 states have call predecessors, (81), 60 states have call successors, (81)
[2021-10-28 23:34:47,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 727 transitions.
[2021-10-28 23:34:47,353 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 727 transitions. Word has length 54
[2021-10-28 23:34:47,353 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:47,353 INFO L470 AbstractCegarLoop]: Abstraction has 573 states and 727 transitions.
[2021-10-28 23:34:47,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 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:34:47,354 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 727 transitions.
[2021-10-28 23:34:47,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2021-10-28 23:34:47,355 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:47,356 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:34:47,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2021-10-28 23:34:47,356 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:47,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:47,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1315437004, now seen corresponding path program 1 times
[2021-10-28 23:34:47,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:47,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650673399]
[2021-10-28 23:34:47,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:47,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:47,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:47,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:47,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:47,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:34:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:47,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2021-10-28 23:34:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:47,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2021-10-28 23:34:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:47,726 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:34:47,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:47,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650673399]
[2021-10-28 23:34:47,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650673399] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:47,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:47,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-10-28 23:34:47,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142150059]
[2021-10-28 23:34:47,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-10-28 23:34:47,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:47,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-10-28 23:34:47,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:34:47,729 INFO L87 Difference]: Start difference. First operand 573 states and 727 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6)
[2021-10-28 23:34:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:49,243 INFO L93 Difference]: Finished difference Result 605 states and 763 transitions.
[2021-10-28 23:34:49,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-10-28 23:34:49,244 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55
[2021-10-28 23:34:49,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:49,247 INFO L225 Difference]: With dead ends: 605
[2021-10-28 23:34:49,247 INFO L226 Difference]: Without dead ends: 580
[2021-10-28 23:34:49,248 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240
[2021-10-28 23:34:49,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states.
[2021-10-28 23:34:49,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 561.
[2021-10-28 23:34:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 445 states have (on average 1.2719101123595506) internal successors, (566), 455 states have internal predecessors, (566), 66 states have call successors, (66), 43 states have call predecessors, (66), 49 states have return successors, (79), 63 states have call predecessors, (79), 58 states have call successors, (79)
[2021-10-28 23:34:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 711 transitions.
[2021-10-28 23:34:49,263 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 711 transitions. Word has length 55
[2021-10-28 23:34:49,263 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:49,263 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 711 transitions.
[2021-10-28 23:34:49,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6)
[2021-10-28 23:34:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 711 transitions.
[2021-10-28 23:34:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2021-10-28 23:34:49,265 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:49,266 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]
[2021-10-28 23:34:49,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2021-10-28 23:34:49,266 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:49,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:49,267 INFO L85 PathProgramCache]: Analyzing trace with hash -423366039, now seen corresponding path program 1 times
[2021-10-28 23:34:49,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:49,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882686240]
[2021-10-28 23:34:49,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:49,268 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:49,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:49,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:49,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:49,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2021-10-28 23:34:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:49,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:34:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:49,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2021-10-28 23:34:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:49,540 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:34:49,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:49,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882686240]
[2021-10-28 23:34:49,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882686240] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:49,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:49,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-10-28 23:34:49,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693416822]
[2021-10-28 23:34:49,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-10-28 23:34:49,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:49,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-10-28 23:34:49,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2021-10-28 23:34:49,543 INFO L87 Difference]: Start difference. First operand 561 states and 711 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 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:34:50,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:50,663 INFO L93 Difference]: Finished difference Result 589 states and 746 transitions.
[2021-10-28 23:34:50,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-10-28 23:34:50,665 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 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 58
[2021-10-28 23:34:50,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:50,667 INFO L225 Difference]: With dead ends: 589
[2021-10-28 23:34:50,667 INFO L226 Difference]: Without dead ends: 589
[2021-10-28 23:34:50,668 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:34:50,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states.
[2021-10-28 23:34:50,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 566.
[2021-10-28 23:34:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 449 states have (on average 1.265033407572383) internal successors, (568), 460 states have internal predecessors, (568), 66 states have call successors, (66), 43 states have call predecessors, (66), 50 states have return successors, (83), 63 states have call predecessors, (83), 58 states have call successors, (83)
[2021-10-28 23:34:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 717 transitions.
[2021-10-28 23:34:50,685 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 717 transitions. Word has length 58
[2021-10-28 23:34:50,685 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:50,685 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 717 transitions.
[2021-10-28 23:34:50,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 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:34:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 717 transitions.
[2021-10-28 23:34:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2021-10-28 23:34:50,688 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:50,688 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]
[2021-10-28 23:34:50,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2021-10-28 23:34:50,689 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:50,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:50,690 INFO L85 PathProgramCache]: Analyzing trace with hash 178096204, now seen corresponding path program 1 times
[2021-10-28 23:34:50,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:50,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834599782]
[2021-10-28 23:34:50,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:50,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:50,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:50,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:50,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:50,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2021-10-28 23:34:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:51,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:34:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:51,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:34:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:51,073 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:34:51,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:51,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834599782]
[2021-10-28 23:34:51,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834599782] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:51,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:51,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-10-28 23:34:51,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177076131]
[2021-10-28 23:34:51,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-10-28 23:34:51,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:51,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-10-28 23:34:51,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:34:51,076 INFO L87 Difference]: Start difference. First operand 566 states and 717 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 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:34:52,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:52,318 INFO L93 Difference]: Finished difference Result 538 states and 675 transitions.
[2021-10-28 23:34:52,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-10-28 23:34:52,318 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 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 64
[2021-10-28 23:34:52,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:52,321 INFO L225 Difference]: With dead ends: 538
[2021-10-28 23:34:52,322 INFO L226 Difference]: Without dead ends: 538
[2021-10-28 23:34:52,322 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:34:52,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states.
[2021-10-28 23:34:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 511.
[2021-10-28 23:34:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 402 states have (on average 1.2537313432835822) internal successors, (504), 410 states have internal predecessors, (504), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (72), 59 states have call predecessors, (72), 56 states have call successors, (72)
[2021-10-28 23:34:52,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 639 transitions.
[2021-10-28 23:34:52,338 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 639 transitions. Word has length 64
[2021-10-28 23:34:52,339 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:52,339 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 639 transitions.
[2021-10-28 23:34:52,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 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:34:52,339 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 639 transitions.
[2021-10-28 23:34:52,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2021-10-28 23:34:52,341 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:52,342 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]
[2021-10-28 23:34:52,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2021-10-28 23:34:52,342 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:52,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:52,343 INFO L85 PathProgramCache]: Analyzing trace with hash -464089137, now seen corresponding path program 1 times
[2021-10-28 23:34:52,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:52,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79328270]
[2021-10-28 23:34:52,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:52,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:52,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:52,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:52,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:52,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:34:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:52,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:34:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:52,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2021-10-28 23:34:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:52,744 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:34:52,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:52,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79328270]
[2021-10-28 23:34:52,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79328270] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:52,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:52,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-10-28 23:34:52,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429092135]
[2021-10-28 23:34:52,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-10-28 23:34:52,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:52,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-10-28 23:34:52,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:34:52,747 INFO L87 Difference]: Start difference. First operand 511 states and 639 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6)
[2021-10-28 23:34:54,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:54,911 INFO L93 Difference]: Finished difference Result 542 states and 675 transitions.
[2021-10-28 23:34:54,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2021-10-28 23:34:54,912 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59
[2021-10-28 23:34:54,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:54,915 INFO L225 Difference]: With dead ends: 542
[2021-10-28 23:34:54,915 INFO L226 Difference]: Without dead ends: 524
[2021-10-28 23:34:54,916 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342
[2021-10-28 23:34:54,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states.
[2021-10-28 23:34:54,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 508.
[2021-10-28 23:34:54,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 399 states have (on average 1.255639097744361) internal successors, (501), 408 states have internal predecessors, (501), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (71), 58 states have call predecessors, (71), 56 states have call successors, (71)
[2021-10-28 23:34:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 635 transitions.
[2021-10-28 23:34:54,931 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 635 transitions. Word has length 59
[2021-10-28 23:34:54,931 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:54,931 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 635 transitions.
[2021-10-28 23:34:54,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6)
[2021-10-28 23:34:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 635 transitions.
[2021-10-28 23:34:54,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2021-10-28 23:34:54,933 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:54,934 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]
[2021-10-28 23:34:54,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2021-10-28 23:34:54,934 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:54,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:54,935 INFO L85 PathProgramCache]: Analyzing trace with hash 462485744, now seen corresponding path program 1 times
[2021-10-28 23:34:54,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:54,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084458122]
[2021-10-28 23:34:54,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:54,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:55,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:55,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:55,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:55,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:34:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:55,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2021-10-28 23:34:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:55,244 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:34:55,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:55,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084458122]
[2021-10-28 23:34:55,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084458122] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:55,245 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:55,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-10-28 23:34:55,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101942903]
[2021-10-28 23:34:55,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2021-10-28 23:34:55,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:55,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-10-28 23:34:55,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156
[2021-10-28 23:34:55,247 INFO L87 Difference]: Start difference. First operand 508 states and 635 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 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:34:56,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:56,628 INFO L93 Difference]: Finished difference Result 535 states and 666 transitions.
[2021-10-28 23:34:56,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-10-28 23:34:56,629 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 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 58
[2021-10-28 23:34:56,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:56,631 INFO L225 Difference]: With dead ends: 535
[2021-10-28 23:34:56,632 INFO L226 Difference]: Without dead ends: 520
[2021-10-28 23:34:56,632 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:34:56,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states.
[2021-10-28 23:34:56,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 504.
[2021-10-28 23:34:56,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 396 states have (on average 1.255050505050505) internal successors, (497), 405 states have internal predecessors, (497), 62 states have call successors, (62), 42 states have call predecessors, (62), 45 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70)
[2021-10-28 23:34:56,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 629 transitions.
[2021-10-28 23:34:56,652 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 629 transitions. Word has length 58
[2021-10-28 23:34:56,652 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:56,653 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 629 transitions.
[2021-10-28 23:34:56,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 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:34:56,653 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 629 transitions.
[2021-10-28 23:34:56,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2021-10-28 23:34:56,655 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:56,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]
[2021-10-28 23:34:56,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2021-10-28 23:34:56,656 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:56,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:56,656 INFO L85 PathProgramCache]: Analyzing trace with hash -238724580, now seen corresponding path program 1 times
[2021-10-28 23:34:56,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:56,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85210737]
[2021-10-28 23:34:56,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:56,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:56,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:56,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:56,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:56,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:34:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:56,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2021-10-28 23:34:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:56,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2021-10-28 23:34:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:56,968 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:34:56,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:56,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85210737]
[2021-10-28 23:34:56,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85210737] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:56,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:56,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:34:56,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381401902]
[2021-10-28 23:34:56,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:34:56,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:56,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:34:56,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:34:56,971 INFO L87 Difference]: Start difference. First operand 504 states and 629 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 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:34:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:34:58,537 INFO L93 Difference]: Finished difference Result 536 states and 666 transitions.
[2021-10-28 23:34:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:34:58,538 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 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 60
[2021-10-28 23:34:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:34:58,541 INFO L225 Difference]: With dead ends: 536
[2021-10-28 23:34:58,541 INFO L226 Difference]: Without dead ends: 515
[2021-10-28 23:34:58,542 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210
[2021-10-28 23:34:58,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states.
[2021-10-28 23:34:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 499.
[2021-10-28 23:34:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.251908396946565) internal successors, (492), 401 states have internal predecessors, (492), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68)
[2021-10-28 23:34:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 621 transitions.
[2021-10-28 23:34:58,555 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 621 transitions. Word has length 60
[2021-10-28 23:34:58,556 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:34:58,556 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 621 transitions.
[2021-10-28 23:34:58,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 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:34:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 621 transitions.
[2021-10-28 23:34:58,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2021-10-28 23:34:58,558 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:34:58,558 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:34:58,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2021-10-28 23:34:58,559 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:34:58,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:34:58,559 INFO L85 PathProgramCache]: Analyzing trace with hash -858312845, now seen corresponding path program 1 times
[2021-10-28 23:34:58,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:34:58,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283543657]
[2021-10-28 23:34:58,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:34:58,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:34:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:58,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:34:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:58,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:34:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:58,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:34:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:58,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2021-10-28 23:34:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:58,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:34:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:58,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:34:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:58,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:34:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:34:58,858 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:34:58,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:34:58,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283543657]
[2021-10-28 23:34:58,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283543657] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:34:58,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:34:58,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:34:58,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793296202]
[2021-10-28 23:34:58,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:34:58,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:34:58,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:34:58,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:34:58,863 INFO L87 Difference]: Start difference. First operand 499 states and 621 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 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:35:00,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:00,826 INFO L93 Difference]: Finished difference Result 521 states and 649 transitions.
[2021-10-28 23:35:00,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-10-28 23:35:00,826 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 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 68
[2021-10-28 23:35:00,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:00,831 INFO L225 Difference]: With dead ends: 521
[2021-10-28 23:35:00,831 INFO L226 Difference]: Without dead ends: 521
[2021-10-28 23:35:00,831 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420
[2021-10-28 23:35:00,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states.
[2021-10-28 23:35:00,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 499.
[2021-10-28 23:35:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.2468193384223918) internal successors, (490), 401 states have internal predecessors, (490), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68)
[2021-10-28 23:35:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions.
[2021-10-28 23:35:00,846 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 68
[2021-10-28 23:35:00,846 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:00,847 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions.
[2021-10-28 23:35:00,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 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:35:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions.
[2021-10-28 23:35:00,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2021-10-28 23:35:00,849 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:00,849 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]
[2021-10-28 23:35:00,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2021-10-28 23:35:00,850 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:00,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:00,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1201869596, now seen corresponding path program 1 times
[2021-10-28 23:35:00,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:00,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562971258]
[2021-10-28 23:35:00,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:00,851 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:00,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:01,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:01,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:35:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:01,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:35:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:01,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:35:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:01,152 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:35:01,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:01,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562971258]
[2021-10-28 23:35:01,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562971258] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:01,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:01,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-10-28 23:35:01,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88825024]
[2021-10-28 23:35:01,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-10-28 23:35:01,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:01,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-10-28 23:35:01,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:35:01,157 INFO L87 Difference]: Start difference. First operand 499 states and 619 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6)
[2021-10-28 23:35:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:02,882 INFO L93 Difference]: Finished difference Result 519 states and 644 transitions.
[2021-10-28 23:35:02,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-10-28 23:35:02,883 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63
[2021-10-28 23:35:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:02,885 INFO L225 Difference]: With dead ends: 519
[2021-10-28 23:35:02,886 INFO L226 Difference]: Without dead ends: 519
[2021-10-28 23:35:02,886 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156
[2021-10-28 23:35:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states.
[2021-10-28 23:35:02,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 503.
[2021-10-28 23:35:02,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 396 states have (on average 1.244949494949495) internal successors, (493), 404 states have internal predecessors, (493), 61 states have call successors, (61), 42 states have call predecessors, (61), 45 states have return successors, (69), 57 states have call predecessors, (69), 54 states have call successors, (69)
[2021-10-28 23:35:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 623 transitions.
[2021-10-28 23:35:02,904 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 623 transitions. Word has length 63
[2021-10-28 23:35:02,904 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:02,904 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 623 transitions.
[2021-10-28 23:35:02,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6)
[2021-10-28 23:35:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 623 transitions.
[2021-10-28 23:35:02,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2021-10-28 23:35:02,907 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:02,907 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]
[2021-10-28 23:35:02,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2021-10-28 23:35:02,908 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:02,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:02,908 INFO L85 PathProgramCache]: Analyzing trace with hash -813300133, now seen corresponding path program 1 times
[2021-10-28 23:35:02,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:02,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38397027]
[2021-10-28 23:35:02,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:02,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:03,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:03,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:03,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:03,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:35:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:03,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:35:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:03,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:35:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:03,236 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:35:03,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:03,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38397027]
[2021-10-28 23:35:03,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38397027] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:03,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:03,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:35:03,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066868396]
[2021-10-28 23:35:03,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:35:03,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:03,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:35:03,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:35:03,239 INFO L87 Difference]: Start difference. First operand 503 states and 623 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6)
[2021-10-28 23:35:04,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:04,934 INFO L93 Difference]: Finished difference Result 505 states and 625 transitions.
[2021-10-28 23:35:04,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:35:04,935 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63
[2021-10-28 23:35:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:04,936 INFO L225 Difference]: With dead ends: 505
[2021-10-28 23:35:04,937 INFO L226 Difference]: Without dead ends: 505
[2021-10-28 23:35:04,937 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306
[2021-10-28 23:35:04,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states.
[2021-10-28 23:35:04,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 489.
[2021-10-28 23:35:04,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 384 states have (on average 1.2395833333333333) internal successors, (476), 391 states have internal predecessors, (476), 60 states have call successors, (60), 42 states have call predecessors, (60), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68)
[2021-10-28 23:35:04,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 604 transitions.
[2021-10-28 23:35:04,950 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 604 transitions. Word has length 63
[2021-10-28 23:35:04,950 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:04,950 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 604 transitions.
[2021-10-28 23:35:04,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6)
[2021-10-28 23:35:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 604 transitions.
[2021-10-28 23:35:04,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2021-10-28 23:35:04,952 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:04,953 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]
[2021-10-28 23:35:04,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2021-10-28 23:35:04,953 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:04,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:04,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1336611306, now seen corresponding path program 1 times
[2021-10-28 23:35:04,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:04,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710156578]
[2021-10-28 23:35:04,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:04,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:05,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:05,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:05,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:05,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:05,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:05,248 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:35:05,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:05,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710156578]
[2021-10-28 23:35:05,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710156578] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:05,249 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:05,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-10-28 23:35:05,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950975812]
[2021-10-28 23:35:05,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-10-28 23:35:05,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:05,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-10-28 23:35:05,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:35:05,252 INFO L87 Difference]: Start difference. First operand 489 states and 604 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 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:35:06,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:06,824 INFO L93 Difference]: Finished difference Result 519 states and 639 transitions.
[2021-10-28 23:35:06,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:35:06,825 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 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 63
[2021-10-28 23:35:06,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:06,829 INFO L225 Difference]: With dead ends: 519
[2021-10-28 23:35:06,829 INFO L226 Difference]: Without dead ends: 501
[2021-10-28 23:35:06,829 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:35:06,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states.
[2021-10-28 23:35:06,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 485.
[2021-10-28 23:35:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.2388451443569555) internal successors, (472), 388 states have internal predecessors, (472), 59 states have call successors, (59), 42 states have call predecessors, (59), 44 states have return successors, (67), 55 states have call predecessors, (67), 53 states have call successors, (67)
[2021-10-28 23:35:06,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 598 transitions.
[2021-10-28 23:35:06,841 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 598 transitions. Word has length 63
[2021-10-28 23:35:06,844 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:06,844 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 598 transitions.
[2021-10-28 23:35:06,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 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:35:06,845 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 598 transitions.
[2021-10-28 23:35:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2021-10-28 23:35:06,847 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:06,847 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]
[2021-10-28 23:35:06,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2021-10-28 23:35:06,847 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:06,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:06,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2015464718, now seen corresponding path program 1 times
[2021-10-28 23:35:06,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:06,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124370287]
[2021-10-28 23:35:06,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:06,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:07,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:07,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:07,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:07,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2021-10-28 23:35:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:07,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:07,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:07,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:07,214 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:35:07,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:07,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124370287]
[2021-10-28 23:35:07,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124370287] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:07,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:07,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:35:07,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559792042]
[2021-10-28 23:35:07,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:35:07,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:07,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:35:07,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:35:07,217 INFO L87 Difference]: Start difference. First operand 485 states and 598 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 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:35:08,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:08,675 INFO L93 Difference]: Finished difference Result 520 states and 645 transitions.
[2021-10-28 23:35:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2021-10-28 23:35:08,676 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 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 71
[2021-10-28 23:35:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:08,678 INFO L225 Difference]: With dead ends: 520
[2021-10-28 23:35:08,678 INFO L226 Difference]: Without dead ends: 520
[2021-10-28 23:35:08,678 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:35:08,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states.
[2021-10-28 23:35:08,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 485.
[2021-10-28 23:35:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.2335958005249343) internal successors, (470), 388 states have internal predecessors, (470), 59 states have call successors, (59), 42 states have call predecessors, (59), 44 states have return successors, (67), 55 states have call predecessors, (67), 53 states have call successors, (67)
[2021-10-28 23:35:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 596 transitions.
[2021-10-28 23:35:08,690 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 596 transitions. Word has length 71
[2021-10-28 23:35:08,691 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:08,691 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 596 transitions.
[2021-10-28 23:35:08,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 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:35:08,691 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 596 transitions.
[2021-10-28 23:35:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2021-10-28 23:35:08,693 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:08,693 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]
[2021-10-28 23:35:08,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2021-10-28 23:35:08,694 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:08,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:08,695 INFO L85 PathProgramCache]: Analyzing trace with hash -137076744, now seen corresponding path program 1 times
[2021-10-28 23:35:08,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:08,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174363504]
[2021-10-28 23:35:08,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:08,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:08,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:08,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:08,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:08,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:35:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:08,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2021-10-28 23:35:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:09,026 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:35:09,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:09,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174363504]
[2021-10-28 23:35:09,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174363504] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:09,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:09,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-10-28 23:35:09,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060208467]
[2021-10-28 23:35:09,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2021-10-28 23:35:09,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:09,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-10-28 23:35:09,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156
[2021-10-28 23:35:09,029 INFO L87 Difference]: Start difference. First operand 485 states and 596 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 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:35:10,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:10,440 INFO L93 Difference]: Finished difference Result 509 states and 624 transitions.
[2021-10-28 23:35:10,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:35:10,440 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 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 64
[2021-10-28 23:35:10,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:10,442 INFO L225 Difference]: With dead ends: 509
[2021-10-28 23:35:10,442 INFO L226 Difference]: Without dead ends: 490
[2021-10-28 23:35:10,442 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:35:10,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states.
[2021-10-28 23:35:10,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 474.
[2021-10-28 23:35:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 372 states have (on average 1.2311827956989247) internal successors, (458), 379 states have internal predecessors, (458), 58 states have call successors, (58), 42 states have call predecessors, (58), 43 states have return successors, (65), 53 states have call predecessors, (65), 52 states have call successors, (65)
[2021-10-28 23:35:10,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 581 transitions.
[2021-10-28 23:35:10,451 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 581 transitions. Word has length 64
[2021-10-28 23:35:10,451 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:10,452 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 581 transitions.
[2021-10-28 23:35:10,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 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:35:10,452 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 581 transitions.
[2021-10-28 23:35:10,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2021-10-28 23:35:10,453 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:10,454 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]
[2021-10-28 23:35:10,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2021-10-28 23:35:10,454 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:10,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:10,455 INFO L85 PathProgramCache]: Analyzing trace with hash 130187692, now seen corresponding path program 1 times
[2021-10-28 23:35:10,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:10,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182431445]
[2021-10-28 23:35:10,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:10,455 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:10,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:10,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:10,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:10,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:10,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:10,730 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:35:10,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:10,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182431445]
[2021-10-28 23:35:10,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182431445] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:10,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:10,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-10-28 23:35:10,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612923941]
[2021-10-28 23:35:10,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-10-28 23:35:10,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:10,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-10-28 23:35:10,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:35:10,736 INFO L87 Difference]: Start difference. First operand 474 states and 581 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 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:35:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:11,991 INFO L93 Difference]: Finished difference Result 504 states and 616 transitions.
[2021-10-28 23:35:11,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:35:11,992 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 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 64
[2021-10-28 23:35:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:11,993 INFO L225 Difference]: With dead ends: 504
[2021-10-28 23:35:11,994 INFO L226 Difference]: Without dead ends: 485
[2021-10-28 23:35:11,994 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:35:11,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states.
[2021-10-28 23:35:12,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469.
[2021-10-28 23:35:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 368 states have (on average 1.2309782608695652) internal successors, (453), 375 states have internal predecessors, (453), 57 states have call successors, (57), 42 states have call predecessors, (57), 43 states have return successors, (64), 52 states have call predecessors, (64), 51 states have call successors, (64)
[2021-10-28 23:35:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 574 transitions.
[2021-10-28 23:35:12,003 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 574 transitions. Word has length 64
[2021-10-28 23:35:12,003 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:12,004 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 574 transitions.
[2021-10-28 23:35:12,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 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:35:12,004 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 574 transitions.
[2021-10-28 23:35:12,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2021-10-28 23:35:12,006 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:12,006 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]
[2021-10-28 23:35:12,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2021-10-28 23:35:12,006 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:12,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:12,007 INFO L85 PathProgramCache]: Analyzing trace with hash -799923778, now seen corresponding path program 1 times
[2021-10-28 23:35:12,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:12,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3970655]
[2021-10-28 23:35:12,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:12,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:12,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:12,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:12,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:12,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:12,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:12,303 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:35:12,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:12,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3970655]
[2021-10-28 23:35:12,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3970655] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:12,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:12,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-10-28 23:35:12,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398939421]
[2021-10-28 23:35:12,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-10-28 23:35:12,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:12,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-10-28 23:35:12,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:35:12,307 INFO L87 Difference]: Start difference. First operand 469 states and 574 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 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:35:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:13,775 INFO L93 Difference]: Finished difference Result 499 states and 609 transitions.
[2021-10-28 23:35:13,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:35:13,776 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 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 64
[2021-10-28 23:35:13,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:13,781 INFO L225 Difference]: With dead ends: 499
[2021-10-28 23:35:13,781 INFO L226 Difference]: Without dead ends: 481
[2021-10-28 23:35:13,782 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:35:13,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states.
[2021-10-28 23:35:13,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 465.
[2021-10-28 23:35:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2301369863013698) internal successors, (449), 372 states have internal predecessors, (449), 56 states have call successors, (56), 42 states have call predecessors, (56), 43 states have return successors, (63), 51 states have call predecessors, (63), 50 states have call successors, (63)
[2021-10-28 23:35:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 568 transitions.
[2021-10-28 23:35:13,792 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 568 transitions. Word has length 64
[2021-10-28 23:35:13,794 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:13,794 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 568 transitions.
[2021-10-28 23:35:13,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 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:35:13,795 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 568 transitions.
[2021-10-28 23:35:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2021-10-28 23:35:13,797 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:13,797 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]
[2021-10-28 23:35:13,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2021-10-28 23:35:13,798 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:13,798 INFO L85 PathProgramCache]: Analyzing trace with hash -163798071, now seen corresponding path program 1 times
[2021-10-28 23:35:13,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:13,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686667161]
[2021-10-28 23:35:13,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:13,799 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:13,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:13,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:14,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:14,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2021-10-28 23:35:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:14,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:14,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:14,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:14,073 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:35:14,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:14,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686667161]
[2021-10-28 23:35:14,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686667161] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:14,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:14,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-10-28 23:35:14,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248941726]
[2021-10-28 23:35:14,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2021-10-28 23:35:14,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:14,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-10-28 23:35:14,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72
[2021-10-28 23:35:14,076 INFO L87 Difference]: Start difference. First operand 465 states and 568 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 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:35:15,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:15,230 INFO L93 Difference]: Finished difference Result 625 states and 761 transitions.
[2021-10-28 23:35:15,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-10-28 23:35:15,231 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 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 70
[2021-10-28 23:35:15,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:15,233 INFO L225 Difference]: With dead ends: 625
[2021-10-28 23:35:15,233 INFO L226 Difference]: Without dead ends: 625
[2021-10-28 23:35:15,233 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:35:15,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states.
[2021-10-28 23:35:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 586.
[2021-10-28 23:35:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 458 states have (on average 1.220524017467249) internal successors, (559), 467 states have internal predecessors, (559), 69 states have call successors, (69), 52 states have call predecessors, (69), 58 states have return successors, (88), 67 states have call predecessors, (88), 64 states have call successors, (88)
[2021-10-28 23:35:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 716 transitions.
[2021-10-28 23:35:15,246 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 716 transitions. Word has length 70
[2021-10-28 23:35:15,246 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:15,246 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 716 transitions.
[2021-10-28 23:35:15,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 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:35:15,247 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 716 transitions.
[2021-10-28 23:35:15,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2021-10-28 23:35:15,249 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:15,249 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:35:15,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2021-10-28 23:35:15,250 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:15,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:15,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1554229741, now seen corresponding path program 1 times
[2021-10-28 23:35:15,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:15,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853719481]
[2021-10-28 23:35:15,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:15,251 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:15,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:15,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:15,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:15,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:15,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2021-10-28 23:35:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:15,587 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:35:15,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:15,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853719481]
[2021-10-28 23:35:15,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853719481] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:15,588 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:15,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-10-28 23:35:15,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636251383]
[2021-10-28 23:35:15,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-10-28 23:35:15,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:15,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-10-28 23:35:15,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:35:15,590 INFO L87 Difference]: Start difference. First operand 586 states and 716 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 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:35:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:16,871 INFO L93 Difference]: Finished difference Result 616 states and 752 transitions.
[2021-10-28 23:35:16,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:35:16,871 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 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 68
[2021-10-28 23:35:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:16,873 INFO L225 Difference]: With dead ends: 616
[2021-10-28 23:35:16,873 INFO L226 Difference]: Without dead ends: 576
[2021-10-28 23:35:16,874 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:35:16,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states.
[2021-10-28 23:35:16,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 560.
[2021-10-28 23:35:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 437 states have (on average 1.2196796338672768) internal successors, (533), 446 states have internal predecessors, (533), 66 states have call successors, (66), 50 states have call predecessors, (66), 56 states have return successors, (85), 64 states have call predecessors, (85), 61 states have call successors, (85)
[2021-10-28 23:35:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 684 transitions.
[2021-10-28 23:35:16,885 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 684 transitions. Word has length 68
[2021-10-28 23:35:16,885 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:16,885 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 684 transitions.
[2021-10-28 23:35:16,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 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:35:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 684 transitions.
[2021-10-28 23:35:16,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2021-10-28 23:35:16,887 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:16,888 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]
[2021-10-28 23:35:16,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2021-10-28 23:35:16,888 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:16,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:16,889 INFO L85 PathProgramCache]: Analyzing trace with hash -635159596, now seen corresponding path program 1 times
[2021-10-28 23:35:16,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:16,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654501907]
[2021-10-28 23:35:16,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:16,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:17,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:17,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:17,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:17,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2021-10-28 23:35:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:17,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:35:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:17,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:35:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:17,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2021-10-28 23:35:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:17,243 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:35:17,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:17,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654501907]
[2021-10-28 23:35:17,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654501907] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:17,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:17,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-10-28 23:35:17,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77712543]
[2021-10-28 23:35:17,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2021-10-28 23:35:17,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:17,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-10-28 23:35:17,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210
[2021-10-28 23:35:17,246 INFO L87 Difference]: Start difference. First operand 560 states and 684 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7)
[2021-10-28 23:35:18,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:18,881 INFO L93 Difference]: Finished difference Result 586 states and 715 transitions.
[2021-10-28 23:35:18,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2021-10-28 23:35:18,882 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71
[2021-10-28 23:35:18,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:18,884 INFO L225 Difference]: With dead ends: 586
[2021-10-28 23:35:18,884 INFO L226 Difference]: Without dead ends: 535
[2021-10-28 23:35:18,885 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420
[2021-10-28 23:35:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states.
[2021-10-28 23:35:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 519.
[2021-10-28 23:35:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 403 states have (on average 1.2133995037220844) internal successors, (489), 412 states have internal predecessors, (489), 62 states have call successors, (62), 47 states have call predecessors, (62), 53 states have return successors, (81), 60 states have call predecessors, (81), 57 states have call successors, (81)
[2021-10-28 23:35:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 632 transitions.
[2021-10-28 23:35:18,895 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 632 transitions. Word has length 71
[2021-10-28 23:35:18,895 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:18,895 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 632 transitions.
[2021-10-28 23:35:18,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7)
[2021-10-28 23:35:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 632 transitions.
[2021-10-28 23:35:18,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2021-10-28 23:35:18,897 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:18,897 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]
[2021-10-28 23:35:18,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2021-10-28 23:35:18,898 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:18,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:18,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1523992416, now seen corresponding path program 1 times
[2021-10-28 23:35:18,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:18,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670063813]
[2021-10-28 23:35:18,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:18,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:19,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:19,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:19,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:19,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2021-10-28 23:35:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:19,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:19,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:19,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:19,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2021-10-28 23:35:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:19,203 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:35:19,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:19,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670063813]
[2021-10-28 23:35:19,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670063813] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:19,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:19,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:35:19,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734251009]
[2021-10-28 23:35:19,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:35:19,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:19,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:35:19,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:35:19,206 INFO L87 Difference]: Start difference. First operand 519 states and 632 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 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:35:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:20,764 INFO L93 Difference]: Finished difference Result 523 states and 631 transitions.
[2021-10-28 23:35:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2021-10-28 23:35:20,764 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 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 82
[2021-10-28 23:35:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:20,766 INFO L225 Difference]: With dead ends: 523
[2021-10-28 23:35:20,767 INFO L226 Difference]: Without dead ends: 523
[2021-10-28 23:35:20,767 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650
[2021-10-28 23:35:20,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states.
[2021-10-28 23:35:20,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 501.
[2021-10-28 23:35:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 389 states have (on average 1.2133676092544987) internal successors, (472), 397 states have internal predecessors, (472), 60 states have call successors, (60), 47 states have call predecessors, (60), 51 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70)
[2021-10-28 23:35:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 602 transitions.
[2021-10-28 23:35:20,777 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 602 transitions. Word has length 82
[2021-10-28 23:35:20,778 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:20,778 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 602 transitions.
[2021-10-28 23:35:20,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 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:35:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 602 transitions.
[2021-10-28 23:35:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2021-10-28 23:35:20,780 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:20,780 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]
[2021-10-28 23:35:20,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2021-10-28 23:35:20,781 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:20,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:20,781 INFO L85 PathProgramCache]: Analyzing trace with hash 100987323, now seen corresponding path program 1 times
[2021-10-28 23:35:20,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:20,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849196378]
[2021-10-28 23:35:20,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:20,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:20,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:20,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:20,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:20,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2021-10-28 23:35:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:21,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:21,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:21,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:21,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63
[2021-10-28 23:35:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:21,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:21,105 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:35:21,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:21,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849196378]
[2021-10-28 23:35:21,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849196378] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:21,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:21,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-10-28 23:35:21,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506473360]
[2021-10-28 23:35:21,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-10-28 23:35:21,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:21,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-10-28 23:35:21,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:35:21,108 INFO L87 Difference]: Start difference. First operand 501 states and 602 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 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:35:22,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:22,076 INFO L93 Difference]: Finished difference Result 585 states and 740 transitions.
[2021-10-28 23:35:22,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2021-10-28 23:35:22,077 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 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 83
[2021-10-28 23:35:22,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:22,079 INFO L225 Difference]: With dead ends: 585
[2021-10-28 23:35:22,079 INFO L226 Difference]: Without dead ends: 585
[2021-10-28 23:35:22,080 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506
[2021-10-28 23:35:22,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states.
[2021-10-28 23:35:22,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 465.
[2021-10-28 23:35:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2136986301369863) internal successors, (443), 371 states have internal predecessors, (443), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60)
[2021-10-28 23:35:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 556 transitions.
[2021-10-28 23:35:22,092 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 556 transitions. Word has length 83
[2021-10-28 23:35:22,092 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:22,092 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 556 transitions.
[2021-10-28 23:35:22,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 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:35:22,093 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 556 transitions.
[2021-10-28 23:35:22,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2021-10-28 23:35:22,094 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:22,095 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]
[2021-10-28 23:35:22,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2021-10-28 23:35:22,095 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:22,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:22,096 INFO L85 PathProgramCache]: Analyzing trace with hash 501668298, now seen corresponding path program 1 times
[2021-10-28 23:35:22,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:22,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074549318]
[2021-10-28 23:35:22,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:22,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:22,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:22,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:22,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:22,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:22,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:22,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:22,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:22,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:22,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2021-10-28 23:35:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:22,470 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:35:22,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:22,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074549318]
[2021-10-28 23:35:22,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074549318] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:22,471 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:22,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2021-10-28 23:35:22,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160876384]
[2021-10-28 23:35:22,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2021-10-28 23:35:22,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:22,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2021-10-28 23:35:22,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240
[2021-10-28 23:35:22,475 INFO L87 Difference]: Start difference. First operand 465 states and 556 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 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:35:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:23,729 INFO L93 Difference]: Finished difference Result 523 states and 626 transitions.
[2021-10-28 23:35:23,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2021-10-28 23:35:23,729 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 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 88
[2021-10-28 23:35:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:23,731 INFO L225 Difference]: With dead ends: 523
[2021-10-28 23:35:23,731 INFO L226 Difference]: Without dead ends: 505
[2021-10-28 23:35:23,732 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 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:35:23,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states.
[2021-10-28 23:35:23,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 473.
[2021-10-28 23:35:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 372 states have (on average 1.2096774193548387) internal successors, (450), 378 states have internal predecessors, (450), 53 states have call successors, (53), 41 states have call predecessors, (53), 47 states have return successors, (63), 54 states have call predecessors, (63), 49 states have call successors, (63)
[2021-10-28 23:35:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 566 transitions.
[2021-10-28 23:35:23,742 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 566 transitions. Word has length 88
[2021-10-28 23:35:23,743 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:23,743 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 566 transitions.
[2021-10-28 23:35:23,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 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:35:23,743 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 566 transitions.
[2021-10-28 23:35:23,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2021-10-28 23:35:23,745 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:23,745 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]
[2021-10-28 23:35:23,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2021-10-28 23:35:23,746 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:23,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:23,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1591352246, now seen corresponding path program 1 times
[2021-10-28 23:35:23,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:23,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227745253]
[2021-10-28 23:35:23,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:23,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:23,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:23,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:23,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:23,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:24,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:24,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:24,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:24,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:24,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2021-10-28 23:35:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:24,096 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:35:24,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:24,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227745253]
[2021-10-28 23:35:24,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227745253] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:24,097 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:24,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2021-10-28 23:35:24,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831517480]
[2021-10-28 23:35:24,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2021-10-28 23:35:24,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:24,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2021-10-28 23:35:24,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240
[2021-10-28 23:35:24,100 INFO L87 Difference]: Start difference. First operand 473 states and 566 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 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:35:25,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:25,433 INFO L93 Difference]: Finished difference Result 523 states and 625 transitions.
[2021-10-28 23:35:25,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2021-10-28 23:35:25,434 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 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 89
[2021-10-28 23:35:25,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:25,436 INFO L225 Difference]: With dead ends: 523
[2021-10-28 23:35:25,436 INFO L226 Difference]: Without dead ends: 505
[2021-10-28 23:35:25,436 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:35:25,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states.
[2021-10-28 23:35:25,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 465.
[2021-10-28 23:35:25,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.210958904109589) internal successors, (442), 371 states have internal predecessors, (442), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60)
[2021-10-28 23:35:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 555 transitions.
[2021-10-28 23:35:25,446 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 555 transitions. Word has length 89
[2021-10-28 23:35:25,447 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:25,447 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 555 transitions.
[2021-10-28 23:35:25,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 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:35:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 555 transitions.
[2021-10-28 23:35:25,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2021-10-28 23:35:25,449 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:25,449 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]
[2021-10-28 23:35:25,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2021-10-28 23:35:25,450 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:25,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:25,451 INFO L85 PathProgramCache]: Analyzing trace with hash 590529597, now seen corresponding path program 1 times
[2021-10-28 23:35:25,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:25,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461678839]
[2021-10-28 23:35:25,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:25,452 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:25,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:25,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:25,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:25,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:25,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2021-10-28 23:35:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:25,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:35:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:25,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2021-10-28 23:35:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:25,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41
[2021-10-28 23:35:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:25,772 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:35:25,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:25,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461678839]
[2021-10-28 23:35:25,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461678839] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:25,773 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:25,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:35:25,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736498087]
[2021-10-28 23:35:25,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:35:25,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:25,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:35:25,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:35:25,775 INFO L87 Difference]: Start difference. First operand 465 states and 555 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8)
[2021-10-28 23:35:27,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:27,263 INFO L93 Difference]: Finished difference Result 611 states and 714 transitions.
[2021-10-28 23:35:27,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2021-10-28 23:35:27,263 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92
[2021-10-28 23:35:27,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:27,265 INFO L225 Difference]: With dead ends: 611
[2021-10-28 23:35:27,265 INFO L226 Difference]: Without dead ends: 611
[2021-10-28 23:35:27,265 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 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:35:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states.
[2021-10-28 23:35:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 586.
[2021-10-28 23:35:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 462 states have (on average 1.2034632034632036) internal successors, (556), 470 states have internal predecessors, (556), 61 states have call successors, (61), 53 states have call predecessors, (61), 62 states have return successors, (72), 63 states have call predecessors, (72), 57 states have call successors, (72)
[2021-10-28 23:35:27,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 689 transitions.
[2021-10-28 23:35:27,280 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 689 transitions. Word has length 92
[2021-10-28 23:35:27,281 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:27,281 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 689 transitions.
[2021-10-28 23:35:27,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8)
[2021-10-28 23:35:27,281 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 689 transitions.
[2021-10-28 23:35:27,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2021-10-28 23:35:27,284 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:27,284 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]
[2021-10-28 23:35:27,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2021-10-28 23:35:27,285 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:27,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:27,285 INFO L85 PathProgramCache]: Analyzing trace with hash -605677229, now seen corresponding path program 1 times
[2021-10-28 23:35:27,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:27,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106535216]
[2021-10-28 23:35:27,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:27,286 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:27,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:27,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:27,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:27,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:27,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2021-10-28 23:35:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:27,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:35:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:27,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2021-10-28 23:35:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:27,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2021-10-28 23:35:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:27,625 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:35:27,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:27,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106535216]
[2021-10-28 23:35:27,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106535216] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:27,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:27,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2021-10-28 23:35:27,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454024790]
[2021-10-28 23:35:27,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2021-10-28 23:35:27,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:27,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2021-10-28 23:35:27,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240
[2021-10-28 23:35:27,627 INFO L87 Difference]: Start difference. First operand 586 states and 689 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 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:35:28,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:28,875 INFO L93 Difference]: Finished difference Result 587 states and 689 transitions.
[2021-10-28 23:35:28,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2021-10-28 23:35:28,875 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 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 93
[2021-10-28 23:35:28,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:28,877 INFO L225 Difference]: With dead ends: 587
[2021-10-28 23:35:28,877 INFO L226 Difference]: Without dead ends: 498
[2021-10-28 23:35:28,878 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462
[2021-10-28 23:35:28,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states.
[2021-10-28 23:35:28,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496.
[2021-10-28 23:35:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.20671834625323) internal successors, (467), 394 states have internal predecessors, (467), 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:35:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 585 transitions.
[2021-10-28 23:35:28,898 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 585 transitions. Word has length 93
[2021-10-28 23:35:28,898 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:28,899 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 585 transitions.
[2021-10-28 23:35:28,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 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:35:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 585 transitions.
[2021-10-28 23:35:28,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2021-10-28 23:35:28,901 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:28,901 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]
[2021-10-28 23:35:28,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2021-10-28 23:35:28,902 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:28,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:28,903 INFO L85 PathProgramCache]: Analyzing trace with hash 612741088, now seen corresponding path program 1 times
[2021-10-28 23:35:28,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:28,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645280810]
[2021-10-28 23:35:28,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:28,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:29,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:29,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:29,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:29,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:29,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:29,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:29,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:29,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:29,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2021-10-28 23:35:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:29,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2021-10-28 23:35:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:29,261 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:35:29,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:29,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645280810]
[2021-10-28 23:35:29,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645280810] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:29,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:29,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-10-28 23:35:29,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040583307]
[2021-10-28 23:35:29,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-10-28 23:35:29,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:29,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-10-28 23:35:29,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:35:29,264 INFO L87 Difference]: Start difference. First operand 496 states and 585 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 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:35:29,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:29,910 INFO L93 Difference]: Finished difference Result 494 states and 580 transitions.
[2021-10-28 23:35:29,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:35:29,911 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 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 99
[2021-10-28 23:35:29,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:29,912 INFO L225 Difference]: With dead ends: 494
[2021-10-28 23:35:29,912 INFO L226 Difference]: Without dead ends: 492
[2021-10-28 23:35:29,912 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 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:35:29,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states.
[2021-10-28 23:35:29,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 439.
[2021-10-28 23:35:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 343 states have (on average 1.19533527696793) internal successors, (410), 349 states have internal predecessors, (410), 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:35:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 512 transitions.
[2021-10-28 23:35:29,921 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 512 transitions. Word has length 99
[2021-10-28 23:35:29,921 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:29,921 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 512 transitions.
[2021-10-28 23:35:29,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 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:35:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 512 transitions.
[2021-10-28 23:35:29,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2021-10-28 23:35:29,922 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:29,922 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]
[2021-10-28 23:35:29,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2021-10-28 23:35:29,923 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:29,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:29,923 INFO L85 PathProgramCache]: Analyzing trace with hash -78015673, now seen corresponding path program 1 times
[2021-10-28 23:35:29,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:29,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070386296]
[2021-10-28 23:35:29,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:29,923 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:30,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:30,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:30,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:30,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:30,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:30,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:30,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:30,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:30,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2021-10-28 23:35:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:30,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2021-10-28 23:35:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:30,296 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:35:30,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:30,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070386296]
[2021-10-28 23:35:30,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070386296] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:30,297 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:30,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-10-28 23:35:30,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497654087]
[2021-10-28 23:35:30,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2021-10-28 23:35:30,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:30,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-10-28 23:35:30,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210
[2021-10-28 23:35:30,300 INFO L87 Difference]: Start difference. First operand 439 states and 512 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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:35:31,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:31,838 INFO L93 Difference]: Finished difference Result 839 states and 983 transitions.
[2021-10-28 23:35:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2021-10-28 23:35:31,838 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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 99
[2021-10-28 23:35:31,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:31,841 INFO L225 Difference]: With dead ends: 839
[2021-10-28 23:35:31,841 INFO L226 Difference]: Without dead ends: 797
[2021-10-28 23:35:31,842 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:35:31,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states.
[2021-10-28 23:35:31,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 419.
[2021-10-28 23:35:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 327 states have (on average 1.1957186544342508) internal successors, (391), 332 states have internal predecessors, (391), 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:35:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 487 transitions.
[2021-10-28 23:35:31,852 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 487 transitions. Word has length 99
[2021-10-28 23:35:31,852 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:31,852 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 487 transitions.
[2021-10-28 23:35:31,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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:35:31,853 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 487 transitions.
[2021-10-28 23:35:31,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105
[2021-10-28 23:35:31,854 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:31,855 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]
[2021-10-28 23:35:31,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2021-10-28 23:35:31,855 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:31,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:31,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1954562899, now seen corresponding path program 1 times
[2021-10-28 23:35:31,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:31,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431458710]
[2021-10-28 23:35:31,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:31,856 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:32,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:32,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:32,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:32,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:32,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:35:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:32,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:35:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:32,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:32,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:32,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:32,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:35:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:32,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:32,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2021-10-28 23:35:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:32,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:35:32,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:32,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431458710]
[2021-10-28 23:35:32,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431458710] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:32,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:32,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2021-10-28 23:35:32,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654495413]
[2021-10-28 23:35:32,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2021-10-28 23:35:32,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:32,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2021-10-28 23:35:32,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342
[2021-10-28 23:35:32,345 INFO L87 Difference]: Start difference. First operand 419 states and 487 transitions. Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 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:35:33,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:33,138 INFO L93 Difference]: Finished difference Result 464 states and 541 transitions.
[2021-10-28 23:35:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2021-10-28 23:35:33,138 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 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 104
[2021-10-28 23:35:33,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:33,140 INFO L225 Difference]: With dead ends: 464
[2021-10-28 23:35:33,140 INFO L226 Difference]: Without dead ends: 438
[2021-10-28 23:35:33,141 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552
[2021-10-28 23:35:33,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states.
[2021-10-28 23:35:33,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 428.
[2021-10-28 23:35:33,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 335 states have (on average 1.182089552238806) internal successors, (396), 341 states have internal predecessors, (396), 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:35:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 493 transitions.
[2021-10-28 23:35:33,150 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 493 transitions. Word has length 104
[2021-10-28 23:35:33,151 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:33,151 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 493 transitions.
[2021-10-28 23:35:33,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 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:35:33,151 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 493 transitions.
[2021-10-28 23:35:33,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2021-10-28 23:35:33,153 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:33,154 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]
[2021-10-28 23:35:33,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2021-10-28 23:35:33,155 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:33,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:33,155 INFO L85 PathProgramCache]: Analyzing trace with hash 260351279, now seen corresponding path program 1 times
[2021-10-28 23:35:33,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:33,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279398654]
[2021-10-28 23:35:33,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:33,156 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:33,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:33,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:33,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:33,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2021-10-28 23:35:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:33,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:33,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:33,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:33,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2021-10-28 23:35:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:33,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:33,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:35:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:33,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:33,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:33,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:33,539 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:35:33,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:33,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279398654]
[2021-10-28 23:35:33,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279398654] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:33,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:33,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-10-28 23:35:33,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557679799]
[2021-10-28 23:35:33,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2021-10-28 23:35:33,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:33,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-10-28 23:35:33,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156
[2021-10-28 23:35:33,541 INFO L87 Difference]: Start difference. First operand 428 states and 493 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10)
[2021-10-28 23:35:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:34,130 INFO L93 Difference]: Finished difference Result 440 states and 505 transitions.
[2021-10-28 23:35:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-10-28 23:35:34,130 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 113
[2021-10-28 23:35:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:34,132 INFO L225 Difference]: With dead ends: 440
[2021-10-28 23:35:34,132 INFO L226 Difference]: Without dead ends: 440
[2021-10-28 23:35:34,132 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306
[2021-10-28 23:35:34,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states.
[2021-10-28 23:35:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 436.
[2021-10-28 23:35:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 341 states have (on average 1.1788856304985338) internal successors, (402), 347 states have internal predecessors, (402), 45 states have call successors, (45), 41 states have call predecessors, (45), 49 states have return successors, (54), 47 states have call predecessors, (54), 41 states have call successors, (54)
[2021-10-28 23:35:34,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 501 transitions.
[2021-10-28 23:35:34,139 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 501 transitions. Word has length 113
[2021-10-28 23:35:34,140 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:34,140 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 501 transitions.
[2021-10-28 23:35:34,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10)
[2021-10-28 23:35:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 501 transitions.
[2021-10-28 23:35:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2021-10-28 23:35:34,142 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:34,142 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]
[2021-10-28 23:35:34,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2021-10-28 23:35:34,143 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:34,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:34,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1796786958, now seen corresponding path program 1 times
[2021-10-28 23:35:34,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:34,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241913716]
[2021-10-28 23:35:34,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:34,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:34,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:34,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:34,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:34,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2021-10-28 23:35:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:34,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:34,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:34,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:34,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2021-10-28 23:35:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:34,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:34,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:35:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:34,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:34,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:34,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:34,503 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:35:34,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:34,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241913716]
[2021-10-28 23:35:34,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241913716] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:34,504 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:34,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-10-28 23:35:34,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49219517]
[2021-10-28 23:35:34,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-10-28 23:35:34,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:34,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-10-28 23:35:34,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:35:34,507 INFO L87 Difference]: Start difference. First operand 436 states and 501 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 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:35:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:35,160 INFO L93 Difference]: Finished difference Result 387 states and 434 transitions.
[2021-10-28 23:35:35,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2021-10-28 23:35:35,160 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 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 113
[2021-10-28 23:35:35,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:35,161 INFO L225 Difference]: With dead ends: 387
[2021-10-28 23:35:35,161 INFO L226 Difference]: Without dead ends: 387
[2021-10-28 23:35:35,161 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:35:35,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states.
[2021-10-28 23:35:35,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 249.
[2021-10-28 23:35:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 195 states have (on average 1.1384615384615384) internal successors, (222), 197 states have internal predecessors, (222), 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:35:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 275 transitions.
[2021-10-28 23:35:35,166 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 275 transitions. Word has length 113
[2021-10-28 23:35:35,166 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:35,166 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 275 transitions.
[2021-10-28 23:35:35,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 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:35:35,167 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 275 transitions.
[2021-10-28 23:35:35,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2021-10-28 23:35:35,167 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:35,168 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, 1, 1, 1]
[2021-10-28 23:35:35,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2021-10-28 23:35:35,168 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:35,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:35,169 INFO L85 PathProgramCache]: Analyzing trace with hash 960404334, now seen corresponding path program 1 times
[2021-10-28 23:35:35,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:35,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642592189]
[2021-10-28 23:35:35,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:35,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:35,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:35,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:35,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:35,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:35,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:35:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:35,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:35:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:35,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:35,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:35,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:35,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:35:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:35,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:35,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2021-10-28 23:35:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:35,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2021-10-28 23:35:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:35,520 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:35:35,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:35,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642592189]
[2021-10-28 23:35:35,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642592189] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:35,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:35,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-10-28 23:35:35,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710979751]
[2021-10-28 23:35:35,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2021-10-28 23:35:35,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:35,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-10-28 23:35:35,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210
[2021-10-28 23:35:35,523 INFO L87 Difference]: Start difference. First operand 249 states and 275 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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:35:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:36,252 INFO L93 Difference]: Finished difference Result 263 states and 291 transitions.
[2021-10-28 23:35:36,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-10-28 23:35:36,253 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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 120
[2021-10-28 23:35:36,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:36,253 INFO L225 Difference]: With dead ends: 263
[2021-10-28 23:35:36,253 INFO L226 Difference]: Without dead ends: 263
[2021-10-28 23:35:36,254 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:35:36,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states.
[2021-10-28 23:35:36,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 253.
[2021-10-28 23:35:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 198 states have (on average 1.1363636363636365) internal successors, (225), 200 states have internal predecessors, (225), 26 states have call successors, (26), 26 states have call predecessors, (26), 28 states have return successors, (28), 26 states have call predecessors, (28), 24 states have call successors, (28)
[2021-10-28 23:35:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 279 transitions.
[2021-10-28 23:35:36,275 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 279 transitions. Word has length 120
[2021-10-28 23:35:36,275 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:36,275 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 279 transitions.
[2021-10-28 23:35:36,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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:35:36,276 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 279 transitions.
[2021-10-28 23:35:36,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2021-10-28 23:35:36,276 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:36,277 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, 1, 1, 1]
[2021-10-28 23:35:36,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2021-10-28 23:35:36,277 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:36,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:36,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1141890831, now seen corresponding path program 1 times
[2021-10-28 23:35:36,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:36,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050111714]
[2021-10-28 23:35:36,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:36,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:36,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:36,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:36,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:36,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:36,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:35:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:36,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:35:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:36,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:36,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:36,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:36,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:35:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:36,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:36,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2021-10-28 23:35:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:36,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2021-10-28 23:35:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:36,652 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:35:36,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:36,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050111714]
[2021-10-28 23:35:36,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050111714] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:36,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:36,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-10-28 23:35:36,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412476990]
[2021-10-28 23:35:36,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2021-10-28 23:35:36,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:36,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-10-28 23:35:36,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210
[2021-10-28 23:35:36,655 INFO L87 Difference]: Start difference. First operand 253 states and 279 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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:35:37,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:37,194 INFO L93 Difference]: Finished difference Result 263 states and 289 transitions.
[2021-10-28 23:35:37,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-10-28 23:35:37,195 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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 120
[2021-10-28 23:35:37,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:37,195 INFO L225 Difference]: With dead ends: 263
[2021-10-28 23:35:37,195 INFO L226 Difference]: Without dead ends: 254
[2021-10-28 23:35:37,196 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:35:37,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states.
[2021-10-28 23:35:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248.
[2021-10-28 23:35:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 194 states have (on average 1.1288659793814433) internal successors, (219), 196 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:35:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 272 transitions.
[2021-10-28 23:35:37,199 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 272 transitions. Word has length 120
[2021-10-28 23:35:37,199 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:37,199 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 272 transitions.
[2021-10-28 23:35:37,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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:35:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 272 transitions.
[2021-10-28 23:35:37,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2021-10-28 23:35:37,201 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:37,201 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:35:37,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2021-10-28 23:35:37,202 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:37,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:37,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1073285628, now seen corresponding path program 1 times
[2021-10-28 23:35:37,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:37,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938900850]
[2021-10-28 23:35:37,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:37,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:37,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:37,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:37,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:37,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:37,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:35:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:37,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:35:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:37,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:37,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:37,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:37,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:35:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:37,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:37,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:35:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:37,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:37,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:37,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:37,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2021-10-28 23:35:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:37,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2021-10-28 23:35:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:37,850 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:35:37,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:37,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938900850]
[2021-10-28 23:35:37,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938900850] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:37,850 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:37,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25
[2021-10-28 23:35:37,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101948473]
[2021-10-28 23:35:37,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2021-10-28 23:35:37,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:37,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2021-10-28 23:35:37,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600
[2021-10-28 23:35:37,853 INFO L87 Difference]: Start difference. First operand 248 states and 272 transitions. Second operand has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 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:35:38,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:38,955 INFO L93 Difference]: Finished difference Result 317 states and 357 transitions.
[2021-10-28 23:35:38,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2021-10-28 23:35:38,955 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 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 150
[2021-10-28 23:35:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:38,956 INFO L225 Difference]: With dead ends: 317
[2021-10-28 23:35:38,956 INFO L226 Difference]: Without dead ends: 285
[2021-10-28 23:35:38,957 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 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:35:38,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states.
[2021-10-28 23:35:38,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 265.
[2021-10-28 23:35:38,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 209 states have (on average 1.138755980861244) internal successors, (238), 211 states have internal predecessors, (238), 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:35:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 293 transitions.
[2021-10-28 23:35:38,960 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 293 transitions. Word has length 150
[2021-10-28 23:35:38,961 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:38,961 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 293 transitions.
[2021-10-28 23:35:38,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 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:35:38,961 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 293 transitions.
[2021-10-28 23:35:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2021-10-28 23:35:38,962 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:38,962 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, 1, 1, 1]
[2021-10-28 23:35:38,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2021-10-28 23:35:38,963 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:38,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:38,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1690329856, now seen corresponding path program 1 times
[2021-10-28 23:35:38,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:38,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509940731]
[2021-10-28 23:35:38,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:38,964 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:39,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:39,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:39,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:39,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:39,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:35:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:39,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:35:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:39,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:39,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:39,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:39,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:35:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:39,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:39,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:35:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:39,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:39,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:39,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:39,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2021-10-28 23:35:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:39,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2021-10-28 23:35:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:39,540 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:35:39,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:39,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509940731]
[2021-10-28 23:35:39,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509940731] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:39,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:39,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24
[2021-10-28 23:35:39,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109371799]
[2021-10-28 23:35:39,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2021-10-28 23:35:39,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:39,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2021-10-28 23:35:39,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552
[2021-10-28 23:35:39,543 INFO L87 Difference]: Start difference. First operand 265 states and 293 transitions. Second operand has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 10 states have internal predecessors, (103), 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:35:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:40,408 INFO L93 Difference]: Finished difference Result 284 states and 314 transitions.
[2021-10-28 23:35:40,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2021-10-28 23:35:40,409 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 10 states have internal predecessors, (103), 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 151
[2021-10-28 23:35:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:40,410 INFO L225 Difference]: With dead ends: 284
[2021-10-28 23:35:40,410 INFO L226 Difference]: Without dead ends: 279
[2021-10-28 23:35:40,410 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:35:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states.
[2021-10-28 23:35:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 265.
[2021-10-28 23:35:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 209 states have (on average 1.1339712918660287) internal successors, (237), 211 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:35:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 292 transitions.
[2021-10-28 23:35:40,414 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 292 transitions. Word has length 151
[2021-10-28 23:35:40,414 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:40,414 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 292 transitions.
[2021-10-28 23:35:40,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 10 states have internal predecessors, (103), 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:35:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 292 transitions.
[2021-10-28 23:35:40,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2021-10-28 23:35:40,416 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:40,417 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]
[2021-10-28 23:35:40,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2021-10-28 23:35:40,417 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:40,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:40,418 INFO L85 PathProgramCache]: Analyzing trace with hash -206728514, now seen corresponding path program 1 times
[2021-10-28 23:35:40,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:40,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842008125]
[2021-10-28 23:35:40,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:40,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:40,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:40,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:40,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:40,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:40,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:35:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:40,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:35:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:40,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:40,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:40,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:40,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:35:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:40,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:40,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:35:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:40,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:40,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:40,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:40,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80
[2021-10-28 23:35:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:41,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2021-10-28 23:35:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:41,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2021-10-28 23:35:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:41,037 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:35:41,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:41,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842008125]
[2021-10-28 23:35:41,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842008125] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:41,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:41,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21
[2021-10-28 23:35:41,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636094563]
[2021-10-28 23:35:41,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2021-10-28 23:35:41,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:41,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2021-10-28 23:35:41,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420
[2021-10-28 23:35:41,041 INFO L87 Difference]: Start difference. First operand 265 states and 292 transitions. Second operand has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 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:35:42,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:42,548 INFO L93 Difference]: Finished difference Result 303 states and 337 transitions.
[2021-10-28 23:35:42,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2021-10-28 23:35:42,548 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 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 153
[2021-10-28 23:35:42,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:42,549 INFO L225 Difference]: With dead ends: 303
[2021-10-28 23:35:42,549 INFO L226 Difference]: Without dead ends: 265
[2021-10-28 23:35:42,549 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812
[2021-10-28 23:35:42,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states.
[2021-10-28 23:35:42,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259.
[2021-10-28 23:35:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 205 states have (on average 1.1219512195121952) internal successors, (230), 207 states have internal predecessors, (230), 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:35:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 283 transitions.
[2021-10-28 23:35:42,553 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 283 transitions. Word has length 153
[2021-10-28 23:35:42,553 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:42,553 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 283 transitions.
[2021-10-28 23:35:42,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 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:35:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 283 transitions.
[2021-10-28 23:35:42,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159
[2021-10-28 23:35:42,554 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:42,556 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, 1]
[2021-10-28 23:35:42,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2021-10-28 23:35:42,557 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:42,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:42,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1217289252, now seen corresponding path program 1 times
[2021-10-28 23:35:42,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:42,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986219509]
[2021-10-28 23:35:42,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:42,561 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:42,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:42,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:42,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:42,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:42,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:35:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:42,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:35:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:42,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:42,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:42,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:42,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:35:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:43,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:43,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:35:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:43,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:43,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:43,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:43,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2021-10-28 23:35:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:43,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2021-10-28 23:35:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:43,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2021-10-28 23:35:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:43,049 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:35:43,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:43,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986219509]
[2021-10-28 23:35:43,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986219509] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:43,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:43,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-10-28 23:35:43,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604796279]
[2021-10-28 23:35:43,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2021-10-28 23:35:43,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:43,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-10-28 23:35:43,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210
[2021-10-28 23:35:43,054 INFO L87 Difference]: Start difference. First operand 259 states and 283 transitions. Second operand has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 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:35:43,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:43,787 INFO L93 Difference]: Finished difference Result 256 states and 277 transitions.
[2021-10-28 23:35:43,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-10-28 23:35:43,788 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 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 158
[2021-10-28 23:35:43,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:43,789 INFO L225 Difference]: With dead ends: 256
[2021-10-28 23:35:43,789 INFO L226 Difference]: Without dead ends: 245
[2021-10-28 23:35:43,790 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552
[2021-10-28 23:35:43,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states.
[2021-10-28 23:35:43,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 231.
[2021-10-28 23:35:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 181 states have (on average 1.1049723756906078) internal successors, (200), 183 states have internal predecessors, (200), 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:35:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions.
[2021-10-28 23:35:43,794 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 158
[2021-10-28 23:35:43,795 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:43,795 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions.
[2021-10-28 23:35:43,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 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:35:43,795 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions.
[2021-10-28 23:35:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2021-10-28 23:35:43,797 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:43,798 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, 1, 1, 1]
[2021-10-28 23:35:43,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2021-10-28 23:35:43,798 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:43,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:43,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1524054683, now seen corresponding path program 1 times
[2021-10-28 23:35:43,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:43,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386189565]
[2021-10-28 23:35:43,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:43,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:43,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:44,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:44,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:44,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:44,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:35:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:44,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:35:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:44,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:44,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:44,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:44,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:35:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:44,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:44,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:35:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:44,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:44,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:44,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:44,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2021-10-28 23:35:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:44,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2021-10-28 23:35:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:44,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2021-10-28 23:35:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:44,326 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:35:44,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:44,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386189565]
[2021-10-28 23:35:44,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386189565] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:44,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:44,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2021-10-28 23:35:44,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749301803]
[2021-10-28 23:35:44,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2021-10-28 23:35:44,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:44,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2021-10-28 23:35:44,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272
[2021-10-28 23:35:44,331 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 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:35:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:44,848 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions.
[2021-10-28 23:35:44,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-10-28 23:35:44,849 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 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 160
[2021-10-28 23:35:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:44,850 INFO L225 Difference]: With dead ends: 220
[2021-10-28 23:35:44,850 INFO L226 Difference]: Without dead ends: 210
[2021-10-28 23:35:44,850 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 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:35:44,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states.
[2021-10-28 23:35:44,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210.
[2021-10-28 23:35:44,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 163 states have (on average 1.0920245398773005) internal successors, (178), 164 states have internal predecessors, (178), 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:35:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 224 transitions.
[2021-10-28 23:35:44,853 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 224 transitions. Word has length 160
[2021-10-28 23:35:44,853 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:44,854 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 224 transitions.
[2021-10-28 23:35:44,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 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:35:44,854 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 224 transitions.
[2021-10-28 23:35:44,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2021-10-28 23:35:44,855 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:44,856 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, 1, 1, 1]
[2021-10-28 23:35:44,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2021-10-28 23:35:44,856 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:44,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:44,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1861413762, now seen corresponding path program 1 times
[2021-10-28 23:35:44,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:44,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664599905]
[2021-10-28 23:35:44,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:44,858 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:35:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:35:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:35:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:35:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2021-10-28 23:35:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2021-10-28 23:35:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106
[2021-10-28 23:35:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:45,425 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:35:45,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:45,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664599905]
[2021-10-28 23:35:45,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664599905] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:45,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:45,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2021-10-28 23:35:45,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499027330]
[2021-10-28 23:35:45,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2021-10-28 23:35:45,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:45,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2021-10-28 23:35:45,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380
[2021-10-28 23:35:45,428 INFO L87 Difference]: Start difference. First operand 210 states and 224 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 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:35:46,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:46,990 INFO L93 Difference]: Finished difference Result 355 states and 377 transitions.
[2021-10-28 23:35:46,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states.
[2021-10-28 23:35:46,990 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 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 161
[2021-10-28 23:35:46,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:46,991 INFO L225 Difference]: With dead ends: 355
[2021-10-28 23:35:46,991 INFO L226 Difference]: Without dead ends: 213
[2021-10-28 23:35:46,992 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352
[2021-10-28 23:35:46,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states.
[2021-10-28 23:35:46,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210.
[2021-10-28 23:35:46,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 163 states have (on average 1.0858895705521472) internal successors, (177), 164 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:35:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 223 transitions.
[2021-10-28 23:35:46,995 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 223 transitions. Word has length 161
[2021-10-28 23:35:46,995 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:46,995 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 223 transitions.
[2021-10-28 23:35:46,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 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:35:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions.
[2021-10-28 23:35:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2021-10-28 23:35:46,997 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:35:46,997 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, 1, 1, 1]
[2021-10-28 23:35:46,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2021-10-28 23:35:46,998 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:35:46,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:35:46,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1510386108, now seen corresponding path program 1 times
[2021-10-28 23:35:46,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:35:46,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850353474]
[2021-10-28 23:35:46,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:35:47,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:35:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:35:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:35:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:35:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2021-10-28 23:35:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:35:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:35:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:35:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:35:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:35:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:35:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:35:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2021-10-28 23:35:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2021-10-28 23:35:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106
[2021-10-28 23:35:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:35:47,685 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:35:47,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:35:47,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850353474]
[2021-10-28 23:35:47,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850353474] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:35:47,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:35:47,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25
[2021-10-28 23:35:47,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377129383]
[2021-10-28 23:35:47,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2021-10-28 23:35:47,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:47,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2021-10-28 23:35:47,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600
[2021-10-28 23:35:47,689 INFO L87 Difference]: Start difference. First operand 210 states and 223 transitions. Second operand has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 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:35:49,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:35:49,060 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions.
[2021-10-28 23:35:49,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2021-10-28 23:35:49,060 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 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 161
[2021-10-28 23:35:49,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:35:49,060 INFO L225 Difference]: With dead ends: 210
[2021-10-28 23:35:49,061 INFO L226 Difference]: Without dead ends: 0
[2021-10-28 23:35:49,061 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980
[2021-10-28 23:35:49,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2021-10-28 23:35:49,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2021-10-28 23:35:49,061 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:35:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2021-10-28 23:35:49,061 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161
[2021-10-28 23:35:49,061 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:35:49,062 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2021-10-28 23:35:49,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 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:35:49,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2021-10-28 23:35:49,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2021-10-28 23:35:49,064 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK
[2021-10-28 23:35:49,065 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK
[2021-10-28 23:35:49,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2021-10-28 23:35:49,068 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:35:49,070 INFO L179 ceAbstractionStarter]: Computing trace abstraction results
[2021-10-28 23:35:49,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 11:35:49 BoogieIcfgContainer
[2021-10-28 23:35:49,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-10-28 23:35:49,072 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2021-10-28 23:35:49,072 INFO L271 PluginConnector]: Initializing Witness Printer...
[2021-10-28 23:35:49,072 INFO L275 PluginConnector]: Witness Printer initialized
[2021-10-28 23:35:49,073 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:33:41" (3/4) ...
[2021-10-28 23:35:49,076 INFO L137 WitnessPrinter]: Generating witness for correct program
[2021-10-28 23:35:49,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error
[2021-10-28 23:35:49,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface
[2021-10-28 23:35:49,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init
[2021-10-28 23:35:49,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests
[2021-10-28 23:35:49,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState
[2021-10-28 23:35:49,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp
[2021-10-28 23:35:49,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main
[2021-10-28 23:35:49,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose
[2021-10-28 23:35:49,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired
[2021-10-28 23:35:49,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete
[2021-10-28 23:35:49,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject
[2021-10-28 23:35:49,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest
[2021-10-28 23:35:49,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice
[2021-10-28 23:35:49,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread
[2021-10-28 23:35:49,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle
[2021-10-28 23:35:49,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest
[2021-10-28 23:35:49,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent
[2021-10-28 23:35:49,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init
[2021-10-28 23:35:49,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn
[2021-10-28 23:35:49,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread
[2021-10-28 23:35:49,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver
[2021-10-28 23:35:49,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl
[2021-10-28 23:35:49,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters
[2021-10-28 23:35:49,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init
[2021-10-28 23:35:49,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest
[2021-10-28 23:35:49,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo
[2021-10-28 23:35:49,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy
[2021-10-28 23:35:49,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink
[2021-10-28 23:35:49,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription
[2021-10-28 23:35:49,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose
[2021-10-28 23:35:49,116 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 86 nodes and edges
[2021-10-28 23:35:49,119 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges
[2021-10-28 23:35:49,122 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges
[2021-10-28 23:35:49,125 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2021-10-28 23:35:49,280 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f4db37-a282-4f89-98ea-9d471b905a56/bin/uautomizer-GMMbpWq8iD/witness.graphml
[2021-10-28 23:35:49,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-10-28 23:35:49,282 INFO L168 Benchmark]: Toolchain (without parser) took 130763.13 ms. Allocated memory was 92.3 MB in the beginning and 297.8 MB in the end (delta: 205.5 MB). Free memory was 71.1 MB in the beginning and 114.8 MB in the end (delta: -43.7 MB). Peak memory consumption was 160.9 MB. Max. memory is 16.1 GB.
[2021-10-28 23:35:49,282 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 92.3 MB. Free memory is still 68.4 MB. There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-28 23:35:49,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 832.25 ms. Allocated memory is still 92.3 MB. Free memory was 70.8 MB in the beginning and 55.3 MB in the end (delta: 15.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB.
[2021-10-28 23:35:49,283 INFO L168 Benchmark]: Boogie Preprocessor took 131.02 ms. Allocated memory is still 92.3 MB. Free memory was 55.3 MB in the beginning and 50.9 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB.
[2021-10-28 23:35:49,284 INFO L168 Benchmark]: RCFGBuilder took 1688.49 ms. Allocated memory was 92.3 MB in the beginning and 123.7 MB in the end (delta: 31.5 MB). Free memory was 50.9 MB in the beginning and 63.0 MB in the end (delta: -12.1 MB). Peak memory consumption was 28.6 MB. Max. memory is 16.1 GB.
[2021-10-28 23:35:49,284 INFO L168 Benchmark]: TraceAbstraction took 127889.49 ms. Allocated memory was 123.7 MB in the beginning and 297.8 MB in the end (delta: 174.1 MB). Free memory was 62.3 MB in the beginning and 140.5 MB in the end (delta: -78.2 MB). Peak memory consumption was 96.2 MB. Max. memory is 16.1 GB.
[2021-10-28 23:35:49,284 INFO L168 Benchmark]: Witness Printer took 208.20 ms. Allocated memory is still 297.8 MB. Free memory was 140.5 MB in the beginning and 114.8 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB.
[2021-10-28 23:35:49,286 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.39 ms. Allocated memory is still 92.3 MB. Free memory is still 68.4 MB. There was no memory consumed. Max. memory is 16.1 GB.
* CACSL2BoogieTranslator took 832.25 ms. Allocated memory is still 92.3 MB. Free memory was 70.8 MB in the beginning and 55.3 MB in the end (delta: 15.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB.
* Boogie Preprocessor took 131.02 ms. Allocated memory is still 92.3 MB. Free memory was 55.3 MB in the beginning and 50.9 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB.
* RCFGBuilder took 1688.49 ms. Allocated memory was 92.3 MB in the beginning and 123.7 MB in the end (delta: 31.5 MB). Free memory was 50.9 MB in the beginning and 63.0 MB in the end (delta: -12.1 MB). Peak memory consumption was 28.6 MB. Max. memory is 16.1 GB.
* TraceAbstraction took 127889.49 ms. Allocated memory was 123.7 MB in the beginning and 297.8 MB in the end (delta: 174.1 MB). Free memory was 62.3 MB in the beginning and 140.5 MB in the end (delta: -78.2 MB). Peak memory consumption was 96.2 MB. Max. memory is 16.1 GB.
* Witness Printer took 208.20 ms. Allocated memory is still 297.8 MB. Free memory was 140.5 MB in the beginning and 114.8 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.2 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: 667]: all allocated memory was freed
For all program executions holds that all allocated memory was freed at this location
- PositiveResult [Line: 1627]: 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 31 procedures, 396 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 127.8s, OverallIterations: 67, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 101.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 24799 SDtfs, 35964 SDslu, 53376 SDs, 0 SdLazy, 91602 SolverSat, 11213 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 72.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1881 GetRequests, 847 SyntacticMatches, 0 SemanticMatches, 1034 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3103 ImplicationChecksByTransitivity, 26.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=932occurred in iteration=20, InterpolantAutomatonStates: 863, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 67 MinimizatonAttempts, 3040 StatesRemovedByMinimization, 65 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 21.9s InterpolantComputationTime, 4766 NumberOfCodeBlocks, 4766 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 4699 ConstructedInterpolants, 0 QuantifiedInterpolants, 21826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 67 PerfectInterpolantSequences, 229/229 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:35:49,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f4db37-a282-4f89-98ea-9d471b905a56/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...