./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 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:53:34,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:53:34,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:53:34,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:53:34,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:53:34,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:53:34,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:53:34,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:53:34,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:53:34,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:53:34,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:53:34,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:53:34,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:53:34,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:53:34,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:53:34,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:53:34,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:53:34,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:53:34,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:53:34,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:53:34,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:53:34,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:53:34,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:53:34,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:53:34,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:53:34,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:53:34,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:53:34,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:53:34,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:53:34,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:53:34,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:53:34,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:53:34,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:53:34,493 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:53:34,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:53:34,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:53:34,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:53:34,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:53:34,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:53:34,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:53:34,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:53:34,497 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:53:34,525 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:53:34,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:53:34,526 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:53:34,526 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:53:34,527 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:53:34,527 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:53:34,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:53:34,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:53:34,527 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:53:34,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:53:34,528 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:53:34,528 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:53:34,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:53:34,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:53:34,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:53:34,529 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:53:34,529 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:53:34,529 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:53:34,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:53:34,530 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:53:34,530 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:53:34,530 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:53:34,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:53:34,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:53:34,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:53:34,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:53:34,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:53:34,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:53:34,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:53:34,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:53:34,532 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:53:34,532 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad [2021-12-14 19:53:34,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:53:34,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:53:34,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:53:34,764 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:53:34,764 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:53:34,765 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-12-14 19:53:34,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa6d22b7/491d8b5c743a40eda67e3cd30cfffbd6/FLAG901773441 [2021-12-14 19:53:35,206 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:53:35,206 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-12-14 19:53:35,229 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa6d22b7/491d8b5c743a40eda67e3cd30cfffbd6/FLAG901773441 [2021-12-14 19:53:35,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa6d22b7/491d8b5c743a40eda67e3cd30cfffbd6 [2021-12-14 19:53:35,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:53:35,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:53:35,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:53:35,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:53:35,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:53:35,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:53:35" (1/1) ... [2021-12-14 19:53:35,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8d17a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:53:35, skipping insertion in model container [2021-12-14 19:53:35,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:53:35" (1/1) ... [2021-12-14 19:53:35,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:53:35,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:53:35,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-12-14 19:53:35,500 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:53:35,506 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:53:35,601 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-12-14 19:53:35,606 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:53:35,618 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:53:35,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:53:35 WrapperNode [2021-12-14 19:53:35,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:53:35,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:53:35,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:53:35,621 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:53:35,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:53:35" (1/1) ... [2021-12-14 19:53:35,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:53:35" (1/1) ... [2021-12-14 19:53:35,709 INFO L137 Inliner]: procedures = 41, calls = 76, calls flagged for inlining = 21, calls inlined = 21, statements flattened = 1331 [2021-12-14 19:53:35,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:53:35,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:53:35,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:53:35,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:53:35,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:53:35" (1/1) ... [2021-12-14 19:53:35,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:53:35" (1/1) ... [2021-12-14 19:53:35,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:53:35" (1/1) ... [2021-12-14 19:53:35,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:53:35" (1/1) ... [2021-12-14 19:53:35,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:53:35" (1/1) ... [2021-12-14 19:53:35,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:53:35" (1/1) ... [2021-12-14 19:53:35,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:53:35" (1/1) ... [2021-12-14 19:53:35,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:53:35,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:53:35,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:53:35,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:53:35,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:53:35" (1/1) ... [2021-12-14 19:53:35,804 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:53:35,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:53:35,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 19:53:35,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 19:53:35,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:53:35,852 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2021-12-14 19:53:35,853 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2021-12-14 19:53:35,853 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2021-12-14 19:53:35,853 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2021-12-14 19:53:35,853 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-12-14 19:53:35,853 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-12-14 19:53:35,853 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-12-14 19:53:35,853 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-12-14 19:53:35,853 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-12-14 19:53:35,854 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-12-14 19:53:35,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:53:35,854 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-12-14 19:53:35,854 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-12-14 19:53:35,854 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2021-12-14 19:53:35,854 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2021-12-14 19:53:35,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:53:35,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:53:36,034 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:53:36,035 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:53:36,049 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 19:53:36,160 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-12-14 19:53:36,161 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-12-14 19:53:36,161 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 19:53:36,174 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-12-14 19:53:36,174 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-12-14 19:53:36,183 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 19:53:36,188 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 19:53:36,204 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 19:53:36,206 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 19:53:36,210 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 19:53:36,211 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 19:53:36,215 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 19:53:36,633 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##170: assume !false; [2021-12-14 19:53:36,633 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2021-12-14 19:53:36,633 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2021-12-14 19:53:36,633 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume !false; [2021-12-14 19:53:36,633 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##66: assume false; [2021-12-14 19:53:36,633 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##127: assume !false; [2021-12-14 19:53:36,633 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##139: assume false; [2021-12-14 19:53:36,633 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume !false; [2021-12-14 19:53:36,634 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2021-12-14 19:53:36,634 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2021-12-14 19:53:36,634 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##169: assume false; [2021-12-14 19:53:36,634 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##236: assume !false; [2021-12-14 19:53:36,634 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##235: assume false; [2021-12-14 19:53:36,634 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##126: assume false; [2021-12-14 19:53:36,635 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 19:53:36,658 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-12-14 19:53:36,658 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-12-14 19:53:36,658 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 19:53:36,659 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 19:53:36,659 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 19:53:36,680 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2021-12-14 19:53:36,680 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume !false; [2021-12-14 19:53:36,680 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: assume false; [2021-12-14 19:53:36,680 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2021-12-14 19:53:36,680 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2021-12-14 19:53:36,680 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2021-12-14 19:53:36,685 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:53:36,692 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:53:36,692 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 19:53:36,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:53:36 BoogieIcfgContainer [2021-12-14 19:53:36,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:53:36,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:53:36,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:53:36,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:53:36,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:53:35" (1/3) ... [2021-12-14 19:53:36,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53fd5218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:53:36, skipping insertion in model container [2021-12-14 19:53:36,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:53:35" (2/3) ... [2021-12-14 19:53:36,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53fd5218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:53:36, skipping insertion in model container [2021-12-14 19:53:36,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:53:36" (3/3) ... [2021-12-14 19:53:36,698 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2021-12-14 19:53:36,702 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:53:36,702 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-14 19:53:36,729 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:53:36,734 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-12-14 19:53:36,734 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-14 19:53:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 319 states, 259 states have (on average 1.5250965250965252) internal successors, (395), 285 states have internal predecessors, (395), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2021-12-14 19:53:36,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 19:53:36,751 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:36,751 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:53:36,751 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:36,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:36,755 INFO L85 PathProgramCache]: Analyzing trace with hash -207662691, now seen corresponding path program 1 times [2021-12-14 19:53:36,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:36,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310731648] [2021-12-14 19:53:36,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:36,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:36,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:36,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310731648] [2021-12-14 19:53:36,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310731648] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:36,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:36,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:53:36,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611844003] [2021-12-14 19:53:36,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:36,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:53:36,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:36,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:53:36,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:53:36,901 INFO L87 Difference]: Start difference. First operand has 319 states, 259 states have (on average 1.5250965250965252) internal successors, (395), 285 states have internal predecessors, (395), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-12-14 19:53:36,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:36,983 INFO L93 Difference]: Finished difference Result 318 states and 469 transitions. [2021-12-14 19:53:36,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:53:36,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2021-12-14 19:53:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:36,992 INFO L225 Difference]: With dead ends: 318 [2021-12-14 19:53:36,993 INFO L226 Difference]: Without dead ends: 316 [2021-12-14 19:53:36,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:53:36,996 INFO L933 BasicCegarLoop]: 467 mSDtfsCounter, 262 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:36,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 630 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:53:37,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-12-14 19:53:37,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2021-12-14 19:53:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 257 states have (on average 1.5058365758754864) internal successors, (387), 281 states have internal predecessors, (387), 50 states have call successors, (50), 7 states have call predecessors, (50), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2021-12-14 19:53:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2021-12-14 19:53:37,044 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 8 [2021-12-14 19:53:37,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:37,045 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2021-12-14 19:53:37,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-12-14 19:53:37,045 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2021-12-14 19:53:37,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:53:37,046 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:37,046 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:53:37,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:53:37,047 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:37,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:37,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1841054047, now seen corresponding path program 1 times [2021-12-14 19:53:37,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:37,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819863624] [2021-12-14 19:53:37,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:37,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:37,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:37,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:37,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819863624] [2021-12-14 19:53:37,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819863624] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:37,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:37,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:53:37,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449147690] [2021-12-14 19:53:37,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:37,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:53:37,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:37,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:53:37,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:53:37,092 INFO L87 Difference]: Start difference. First operand 315 states and 466 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:37,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:37,192 INFO L93 Difference]: Finished difference Result 438 states and 641 transitions. [2021-12-14 19:53:37,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:53:37,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:53:37,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:37,194 INFO L225 Difference]: With dead ends: 438 [2021-12-14 19:53:37,194 INFO L226 Difference]: Without dead ends: 438 [2021-12-14 19:53:37,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:53:37,196 INFO L933 BasicCegarLoop]: 579 mSDtfsCounter, 370 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:37,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 779 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:37,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-12-14 19:53:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 417. [2021-12-14 19:53:37,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 358 states have (on average 1.4245810055865922) internal successors, (510), 362 states have internal predecessors, (510), 48 states have call successors, (48), 11 states have call predecessors, (48), 9 states have return successors, (52), 44 states have call predecessors, (52), 37 states have call successors, (52) [2021-12-14 19:53:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 610 transitions. [2021-12-14 19:53:37,216 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 610 transitions. Word has length 16 [2021-12-14 19:53:37,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:37,217 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 610 transitions. [2021-12-14 19:53:37,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 610 transitions. [2021-12-14 19:53:37,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 19:53:37,217 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:37,218 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:53:37,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:53:37,218 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:37,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:37,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1499851735, now seen corresponding path program 1 times [2021-12-14 19:53:37,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:37,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607000703] [2021-12-14 19:53:37,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:37,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:37,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:37,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607000703] [2021-12-14 19:53:37,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607000703] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:37,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:37,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:53:37,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125062283] [2021-12-14 19:53:37,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:37,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:53:37,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:37,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:53:37,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:53:37,268 INFO L87 Difference]: Start difference. First operand 417 states and 610 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-12-14 19:53:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:37,303 INFO L93 Difference]: Finished difference Result 416 states and 609 transitions. [2021-12-14 19:53:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:53:37,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 14 [2021-12-14 19:53:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:37,307 INFO L225 Difference]: With dead ends: 416 [2021-12-14 19:53:37,307 INFO L226 Difference]: Without dead ends: 411 [2021-12-14 19:53:37,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:53:37,312 INFO L933 BasicCegarLoop]: 445 mSDtfsCounter, 272 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:37,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 543 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:53:37,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2021-12-14 19:53:37,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2021-12-14 19:53:37,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 353 states have (on average 1.4022662889518414) internal successors, (495), 356 states have internal predecessors, (495), 48 states have call successors, (48), 11 states have call predecessors, (48), 9 states have return successors, (52), 44 states have call predecessors, (52), 37 states have call successors, (52) [2021-12-14 19:53:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 595 transitions. [2021-12-14 19:53:37,330 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 595 transitions. Word has length 14 [2021-12-14 19:53:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:37,330 INFO L470 AbstractCegarLoop]: Abstraction has 411 states and 595 transitions. [2021-12-14 19:53:37,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-12-14 19:53:37,331 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 595 transitions. [2021-12-14 19:53:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 19:53:37,332 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:37,332 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:53:37,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:53:37,332 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:37,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:37,333 INFO L85 PathProgramCache]: Analyzing trace with hash -866854956, now seen corresponding path program 1 times [2021-12-14 19:53:37,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:37,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366975443] [2021-12-14 19:53:37,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:37,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:37,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:37,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366975443] [2021-12-14 19:53:37,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366975443] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:37,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:37,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:53:37,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645740399] [2021-12-14 19:53:37,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:37,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:53:37,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:37,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:53:37,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:53:37,395 INFO L87 Difference]: Start difference. First operand 411 states and 595 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:37,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:37,412 INFO L93 Difference]: Finished difference Result 497 states and 703 transitions. [2021-12-14 19:53:37,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:53:37,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-14 19:53:37,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:37,414 INFO L225 Difference]: With dead ends: 497 [2021-12-14 19:53:37,414 INFO L226 Difference]: Without dead ends: 497 [2021-12-14 19:53:37,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:53:37,415 INFO L933 BasicCegarLoop]: 437 mSDtfsCounter, 407 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:37,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 540 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:53:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-12-14 19:53:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 459. [2021-12-14 19:53:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 394 states have (on average 1.3959390862944163) internal successors, (550), 404 states have internal predecessors, (550), 50 states have call successors, (50), 14 states have call predecessors, (50), 14 states have return successors, (59), 43 states have call predecessors, (59), 41 states have call successors, (59) [2021-12-14 19:53:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 659 transitions. [2021-12-14 19:53:37,431 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 659 transitions. Word has length 19 [2021-12-14 19:53:37,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:37,432 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 659 transitions. [2021-12-14 19:53:37,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:37,432 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 659 transitions. [2021-12-14 19:53:37,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:53:37,433 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:37,433 INFO L514 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] [2021-12-14 19:53:37,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:53:37,433 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:37,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:37,433 INFO L85 PathProgramCache]: Analyzing trace with hash 122564209, now seen corresponding path program 1 times [2021-12-14 19:53:37,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:37,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896485557] [2021-12-14 19:53:37,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:37,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:37,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:37,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896485557] [2021-12-14 19:53:37,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896485557] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:37,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:37,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:53:37,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992822848] [2021-12-14 19:53:37,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:37,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:53:37,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:37,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:53:37,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:53:37,469 INFO L87 Difference]: Start difference. First operand 459 states and 659 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:37,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:37,483 INFO L93 Difference]: Finished difference Result 638 states and 904 transitions. [2021-12-14 19:53:37,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:53:37,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-14 19:53:37,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:37,486 INFO L225 Difference]: With dead ends: 638 [2021-12-14 19:53:37,486 INFO L226 Difference]: Without dead ends: 638 [2021-12-14 19:53:37,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:53:37,487 INFO L933 BasicCegarLoop]: 494 mSDtfsCounter, 394 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:37,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 655 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:53:37,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-12-14 19:53:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 613. [2021-12-14 19:53:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 531 states have (on average 1.384180790960452) internal successors, (735), 538 states have internal predecessors, (735), 60 states have call successors, (60), 22 states have call predecessors, (60), 21 states have return successors, (80), 55 states have call predecessors, (80), 53 states have call successors, (80) [2021-12-14 19:53:37,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 875 transitions. [2021-12-14 19:53:37,500 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 875 transitions. Word has length 22 [2021-12-14 19:53:37,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:37,500 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 875 transitions. [2021-12-14 19:53:37,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:37,500 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 875 transitions. [2021-12-14 19:53:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:53:37,502 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:37,502 INFO L514 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] [2021-12-14 19:53:37,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:53:37,502 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:37,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:37,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2116337547, now seen corresponding path program 1 times [2021-12-14 19:53:37,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:37,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691716189] [2021-12-14 19:53:37,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:37,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:37,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:53:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:37,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:53:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:37,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-12-14 19:53:37,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:37,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691716189] [2021-12-14 19:53:37,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691716189] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:37,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:37,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:53:37,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913970154] [2021-12-14 19:53:37,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:37,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:53:37,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:37,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:53:37,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:53:37,543 INFO L87 Difference]: Start difference. First operand 613 states and 875 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 2 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-12-14 19:53:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:37,816 INFO L93 Difference]: Finished difference Result 669 states and 949 transitions. [2021-12-14 19:53:37,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:53:37,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 2 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 29 [2021-12-14 19:53:37,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:37,819 INFO L225 Difference]: With dead ends: 669 [2021-12-14 19:53:37,819 INFO L226 Difference]: Without dead ends: 669 [2021-12-14 19:53:37,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:53:37,820 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 115 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:37,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 1246 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2021-12-14 19:53:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 648. [2021-12-14 19:53:37,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 564 states have (on average 1.375886524822695) internal successors, (776), 571 states have internal predecessors, (776), 60 states have call successors, (60), 22 states have call predecessors, (60), 23 states have return successors, (85), 55 states have call predecessors, (85), 53 states have call successors, (85) [2021-12-14 19:53:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 921 transitions. [2021-12-14 19:53:37,834 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 921 transitions. Word has length 29 [2021-12-14 19:53:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:37,834 INFO L470 AbstractCegarLoop]: Abstraction has 648 states and 921 transitions. [2021-12-14 19:53:37,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 2 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-12-14 19:53:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 921 transitions. [2021-12-14 19:53:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 19:53:37,835 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:37,836 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:53:37,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:53:37,836 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:37,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:37,837 INFO L85 PathProgramCache]: Analyzing trace with hash -205375653, now seen corresponding path program 1 times [2021-12-14 19:53:37,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:37,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134706359] [2021-12-14 19:53:37,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:37,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:37,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:37,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134706359] [2021-12-14 19:53:37,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134706359] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:37,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:37,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:53:37,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545031557] [2021-12-14 19:53:37,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:37,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:53:37,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:37,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:53:37,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:53:37,870 INFO L87 Difference]: Start difference. First operand 648 states and 921 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:37,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:37,914 INFO L93 Difference]: Finished difference Result 660 states and 937 transitions. [2021-12-14 19:53:37,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:53:37,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-14 19:53:37,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:37,918 INFO L225 Difference]: With dead ends: 660 [2021-12-14 19:53:37,918 INFO L226 Difference]: Without dead ends: 660 [2021-12-14 19:53:37,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:53:37,919 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 20 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:37,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 778 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:53:37,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-12-14 19:53:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 659. [2021-12-14 19:53:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 575 states have (on average 1.373913043478261) internal successors, (790), 581 states have internal predecessors, (790), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (85), 55 states have call predecessors, (85), 53 states have call successors, (85) [2021-12-14 19:53:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 935 transitions. [2021-12-14 19:53:37,932 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 935 transitions. Word has length 28 [2021-12-14 19:53:37,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:37,933 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 935 transitions. [2021-12-14 19:53:37,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 935 transitions. [2021-12-14 19:53:37,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:53:37,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:37,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:53:37,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:53:37,935 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:37,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:37,935 INFO L85 PathProgramCache]: Analyzing trace with hash -729865897, now seen corresponding path program 1 times [2021-12-14 19:53:37,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:37,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018164013] [2021-12-14 19:53:37,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:37,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:37,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:53:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:38,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:53:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:38,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:38,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018164013] [2021-12-14 19:53:38,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018164013] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:38,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:38,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:53:38,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186379997] [2021-12-14 19:53:38,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:38,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:53:38,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:38,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:53:38,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:38,033 INFO L87 Difference]: Start difference. First operand 659 states and 935 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:53:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:38,346 INFO L93 Difference]: Finished difference Result 680 states and 962 transitions. [2021-12-14 19:53:38,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:53:38,347 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2021-12-14 19:53:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:38,349 INFO L225 Difference]: With dead ends: 680 [2021-12-14 19:53:38,350 INFO L226 Difference]: Without dead ends: 680 [2021-12-14 19:53:38,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:53:38,351 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 608 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:38,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [622 Valid, 1197 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:53:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2021-12-14 19:53:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 659. [2021-12-14 19:53:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 575 states have (on average 1.3721739130434782) internal successors, (789), 581 states have internal predecessors, (789), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (85), 55 states have call predecessors, (85), 53 states have call successors, (85) [2021-12-14 19:53:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 934 transitions. [2021-12-14 19:53:38,364 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 934 transitions. Word has length 30 [2021-12-14 19:53:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:38,366 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 934 transitions. [2021-12-14 19:53:38,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:53:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 934 transitions. [2021-12-14 19:53:38,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:53:38,369 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:38,369 INFO L514 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] [2021-12-14 19:53:38,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:53:38,369 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:38,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1222819339, now seen corresponding path program 1 times [2021-12-14 19:53:38,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:38,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699343657] [2021-12-14 19:53:38,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:38,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:38,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:53:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:38,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:53:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:38,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:38,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:38,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699343657] [2021-12-14 19:53:38,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699343657] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:38,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:38,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:53:38,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964746452] [2021-12-14 19:53:38,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:38,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:53:38,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:38,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:53:38,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:38,443 INFO L87 Difference]: Start difference. First operand 659 states and 934 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:53:38,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:38,728 INFO L93 Difference]: Finished difference Result 680 states and 961 transitions. [2021-12-14 19:53:38,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:53:38,728 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2021-12-14 19:53:38,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:38,731 INFO L225 Difference]: With dead ends: 680 [2021-12-14 19:53:38,731 INFO L226 Difference]: Without dead ends: 680 [2021-12-14 19:53:38,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:53:38,732 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 670 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:38,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [684 Valid, 951 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:38,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2021-12-14 19:53:38,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 659. [2021-12-14 19:53:38,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 575 states have (on average 1.3704347826086956) internal successors, (788), 581 states have internal predecessors, (788), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (85), 55 states have call predecessors, (85), 53 states have call successors, (85) [2021-12-14 19:53:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 933 transitions. [2021-12-14 19:53:38,742 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 933 transitions. Word has length 32 [2021-12-14 19:53:38,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:38,742 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 933 transitions. [2021-12-14 19:53:38,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:53:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 933 transitions. [2021-12-14 19:53:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 19:53:38,743 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:38,743 INFO L514 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-12-14 19:53:38,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:53:38,743 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:38,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:38,744 INFO L85 PathProgramCache]: Analyzing trace with hash -663319401, now seen corresponding path program 1 times [2021-12-14 19:53:38,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:38,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833406380] [2021-12-14 19:53:38,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:38,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:38,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:53:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:38,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:53:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:38,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:38,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833406380] [2021-12-14 19:53:38,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833406380] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:38,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:38,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:53:38,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005008119] [2021-12-14 19:53:38,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:38,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:53:38,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:38,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:53:38,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:53:38,791 INFO L87 Difference]: Start difference. First operand 659 states and 933 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:53:39,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:39,022 INFO L93 Difference]: Finished difference Result 688 states and 969 transitions. [2021-12-14 19:53:39,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:53:39,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2021-12-14 19:53:39,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:39,025 INFO L225 Difference]: With dead ends: 688 [2021-12-14 19:53:39,025 INFO L226 Difference]: Without dead ends: 676 [2021-12-14 19:53:39,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:39,026 INFO L933 BasicCegarLoop]: 430 mSDtfsCounter, 395 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:39,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 1504 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:39,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-12-14 19:53:39,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 657. [2021-12-14 19:53:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 574 states have (on average 1.3693379790940767) internal successors, (786), 580 states have internal predecessors, (786), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (84), 54 states have call predecessors, (84), 52 states have call successors, (84) [2021-12-14 19:53:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 929 transitions. [2021-12-14 19:53:39,037 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 929 transitions. Word has length 33 [2021-12-14 19:53:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:39,037 INFO L470 AbstractCegarLoop]: Abstraction has 657 states and 929 transitions. [2021-12-14 19:53:39,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:53:39,038 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 929 transitions. [2021-12-14 19:53:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:53:39,038 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:39,038 INFO L514 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] [2021-12-14 19:53:39,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 19:53:39,039 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:39,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:39,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2133265312, now seen corresponding path program 1 times [2021-12-14 19:53:39,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:39,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029136453] [2021-12-14 19:53:39,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:39,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:39,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:53:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:39,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:53:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:39,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:39,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029136453] [2021-12-14 19:53:39,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029136453] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:39,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:39,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:53:39,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157913116] [2021-12-14 19:53:39,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:39,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:53:39,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:39,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:53:39,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:53:39,088 INFO L87 Difference]: Start difference. First operand 657 states and 929 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:53:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:39,304 INFO L93 Difference]: Finished difference Result 686 states and 965 transitions. [2021-12-14 19:53:39,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:53:39,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-12-14 19:53:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:39,307 INFO L225 Difference]: With dead ends: 686 [2021-12-14 19:53:39,307 INFO L226 Difference]: Without dead ends: 669 [2021-12-14 19:53:39,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:39,308 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 394 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:39,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [422 Valid, 1464 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2021-12-14 19:53:39,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 650. [2021-12-14 19:53:39,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 570 states have (on average 1.3701754385964913) internal successors, (781), 576 states have internal predecessors, (781), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (82), 52 states have call predecessors, (82), 50 states have call successors, (82) [2021-12-14 19:53:39,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 920 transitions. [2021-12-14 19:53:39,319 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 920 transitions. Word has length 32 [2021-12-14 19:53:39,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:39,319 INFO L470 AbstractCegarLoop]: Abstraction has 650 states and 920 transitions. [2021-12-14 19:53:39,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:53:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 920 transitions. [2021-12-14 19:53:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:53:39,320 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:39,320 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:53:39,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:53:39,321 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:39,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:39,321 INFO L85 PathProgramCache]: Analyzing trace with hash -608614884, now seen corresponding path program 1 times [2021-12-14 19:53:39,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:39,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048464422] [2021-12-14 19:53:39,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:39,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:39,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:39,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048464422] [2021-12-14 19:53:39,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048464422] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:39,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:39,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:53:39,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549637152] [2021-12-14 19:53:39,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:39,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:53:39,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:39,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:53:39,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:53:39,343 INFO L87 Difference]: Start difference. First operand 650 states and 920 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:39,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:39,356 INFO L93 Difference]: Finished difference Result 666 states and 931 transitions. [2021-12-14 19:53:39,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:53:39,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-14 19:53:39,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:39,359 INFO L225 Difference]: With dead ends: 666 [2021-12-14 19:53:39,359 INFO L226 Difference]: Without dead ends: 625 [2021-12-14 19:53:39,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:53:39,359 INFO L933 BasicCegarLoop]: 483 mSDtfsCounter, 84 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:39,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 880 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:53:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2021-12-14 19:53:39,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 621. [2021-12-14 19:53:39,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 545 states have (on average 1.3688073394495412) internal successors, (746), 552 states have internal predecessors, (746), 55 states have call successors, (55), 21 states have call predecessors, (55), 20 states have return successors, (78), 48 states have call predecessors, (78), 48 states have call successors, (78) [2021-12-14 19:53:39,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 879 transitions. [2021-12-14 19:53:39,369 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 879 transitions. Word has length 30 [2021-12-14 19:53:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:39,370 INFO L470 AbstractCegarLoop]: Abstraction has 621 states and 879 transitions. [2021-12-14 19:53:39,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 879 transitions. [2021-12-14 19:53:39,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:53:39,371 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:39,371 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:53:39,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:53:39,371 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:39,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:39,371 INFO L85 PathProgramCache]: Analyzing trace with hash -444205772, now seen corresponding path program 1 times [2021-12-14 19:53:39,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:39,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558697914] [2021-12-14 19:53:39,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:39,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:39,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:39,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:39,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558697914] [2021-12-14 19:53:39,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558697914] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:39,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:39,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:53:39,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479094220] [2021-12-14 19:53:39,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:39,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:53:39,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:39,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:53:39,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:53:39,394 INFO L87 Difference]: Start difference. First operand 621 states and 879 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:39,420 INFO L93 Difference]: Finished difference Result 637 states and 896 transitions. [2021-12-14 19:53:39,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:53:39,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-14 19:53:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:39,423 INFO L225 Difference]: With dead ends: 637 [2021-12-14 19:53:39,423 INFO L226 Difference]: Without dead ends: 637 [2021-12-14 19:53:39,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:53:39,424 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 27 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:39,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 1213 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:53:39,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2021-12-14 19:53:39,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 623. [2021-12-14 19:53:39,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 547 states have (on average 1.3674588665447898) internal successors, (748), 554 states have internal predecessors, (748), 55 states have call successors, (55), 21 states have call predecessors, (55), 20 states have return successors, (78), 48 states have call predecessors, (78), 48 states have call successors, (78) [2021-12-14 19:53:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 881 transitions. [2021-12-14 19:53:39,433 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 881 transitions. Word has length 30 [2021-12-14 19:53:39,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:39,434 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 881 transitions. [2021-12-14 19:53:39,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:39,434 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 881 transitions. [2021-12-14 19:53:39,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 19:53:39,435 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:39,435 INFO L514 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-12-14 19:53:39,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:53:39,435 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:39,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:39,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1157172862, now seen corresponding path program 1 times [2021-12-14 19:53:39,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:39,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10815692] [2021-12-14 19:53:39,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:39,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:39,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:39,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10815692] [2021-12-14 19:53:39,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10815692] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:39,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:39,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:53:39,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66201981] [2021-12-14 19:53:39,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:39,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:53:39,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:39,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:53:39,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:53:39,458 INFO L87 Difference]: Start difference. First operand 623 states and 881 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:39,496 INFO L93 Difference]: Finished difference Result 639 states and 898 transitions. [2021-12-14 19:53:39,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:53:39,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-14 19:53:39,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:39,498 INFO L225 Difference]: With dead ends: 639 [2021-12-14 19:53:39,498 INFO L226 Difference]: Without dead ends: 639 [2021-12-14 19:53:39,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:53:39,499 INFO L933 BasicCegarLoop]: 423 mSDtfsCounter, 28 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:39,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 1217 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:53:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-12-14 19:53:39,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 623. [2021-12-14 19:53:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 547 states have (on average 1.3674588665447898) internal successors, (748), 554 states have internal predecessors, (748), 55 states have call successors, (55), 21 states have call predecessors, (55), 20 states have return successors, (78), 48 states have call predecessors, (78), 48 states have call successors, (78) [2021-12-14 19:53:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 881 transitions. [2021-12-14 19:53:39,509 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 881 transitions. Word has length 31 [2021-12-14 19:53:39,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:39,509 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 881 transitions. [2021-12-14 19:53:39,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 881 transitions. [2021-12-14 19:53:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 19:53:39,510 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:39,510 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:53:39,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:53:39,510 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:39,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:39,511 INFO L85 PathProgramCache]: Analyzing trace with hash 791167666, now seen corresponding path program 1 times [2021-12-14 19:53:39,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:39,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673916478] [2021-12-14 19:53:39,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:39,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:39,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:53:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:39,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:39,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673916478] [2021-12-14 19:53:39,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673916478] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:39,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:39,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:53:39,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693279186] [2021-12-14 19:53:39,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:39,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:53:39,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:39,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:53:39,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:53:39,538 INFO L87 Difference]: Start difference. First operand 623 states and 881 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:39,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:39,743 INFO L93 Difference]: Finished difference Result 881 states and 1243 transitions. [2021-12-14 19:53:39,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:53:39,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2021-12-14 19:53:39,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:39,746 INFO L225 Difference]: With dead ends: 881 [2021-12-14 19:53:39,746 INFO L226 Difference]: Without dead ends: 881 [2021-12-14 19:53:39,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:53:39,747 INFO L933 BasicCegarLoop]: 506 mSDtfsCounter, 162 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:39,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 1133 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:39,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2021-12-14 19:53:39,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 702. [2021-12-14 19:53:39,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 622 states have (on average 1.3762057877813505) internal successors, (856), 630 states have internal predecessors, (856), 57 states have call successors, (57), 23 states have call predecessors, (57), 22 states have return successors, (80), 49 states have call predecessors, (80), 50 states have call successors, (80) [2021-12-14 19:53:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 993 transitions. [2021-12-14 19:53:39,758 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 993 transitions. Word has length 34 [2021-12-14 19:53:39,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:39,758 INFO L470 AbstractCegarLoop]: Abstraction has 702 states and 993 transitions. [2021-12-14 19:53:39,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:39,759 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 993 transitions. [2021-12-14 19:53:39,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 19:53:39,759 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:39,759 INFO L514 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-12-14 19:53:39,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 19:53:39,760 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:39,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:39,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1367133224, now seen corresponding path program 1 times [2021-12-14 19:53:39,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:39,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526413743] [2021-12-14 19:53:39,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:39,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:39,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-14 19:53:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:39,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:39,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526413743] [2021-12-14 19:53:39,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526413743] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:39,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:39,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:53:39,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920124662] [2021-12-14 19:53:39,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:39,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:53:39,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:39,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:53:39,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:53:39,789 INFO L87 Difference]: Start difference. First operand 702 states and 993 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:39,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:39,922 INFO L93 Difference]: Finished difference Result 730 states and 1027 transitions. [2021-12-14 19:53:39,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:53:39,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-12-14 19:53:39,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:39,925 INFO L225 Difference]: With dead ends: 730 [2021-12-14 19:53:39,925 INFO L226 Difference]: Without dead ends: 717 [2021-12-14 19:53:39,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:53:39,926 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 85 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:39,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 1396 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:39,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-12-14 19:53:39,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 700. [2021-12-14 19:53:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 621 states have (on average 1.3752012882447664) internal successors, (854), 629 states have internal predecessors, (854), 56 states have call successors, (56), 23 states have call predecessors, (56), 22 states have return successors, (79), 48 states have call predecessors, (79), 49 states have call successors, (79) [2021-12-14 19:53:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 989 transitions. [2021-12-14 19:53:39,936 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 989 transitions. Word has length 33 [2021-12-14 19:53:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:39,937 INFO L470 AbstractCegarLoop]: Abstraction has 700 states and 989 transitions. [2021-12-14 19:53:39,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 989 transitions. [2021-12-14 19:53:39,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:53:39,938 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:39,938 INFO L514 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] [2021-12-14 19:53:39,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 19:53:39,938 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:39,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:39,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1481962220, now seen corresponding path program 1 times [2021-12-14 19:53:39,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:39,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818725315] [2021-12-14 19:53:39,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:39,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:39,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:53:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:39,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:39,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818725315] [2021-12-14 19:53:39,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818725315] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:39,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:39,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:53:39,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661767408] [2021-12-14 19:53:39,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:39,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:53:39,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:39,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:53:39,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:53:39,989 INFO L87 Difference]: Start difference. First operand 700 states and 989 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:40,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:40,297 INFO L93 Difference]: Finished difference Result 729 states and 1012 transitions. [2021-12-14 19:53:40,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:53:40,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-12-14 19:53:40,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:40,301 INFO L225 Difference]: With dead ends: 729 [2021-12-14 19:53:40,301 INFO L226 Difference]: Without dead ends: 729 [2021-12-14 19:53:40,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:40,301 INFO L933 BasicCegarLoop]: 506 mSDtfsCounter, 721 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:40,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [739 Valid, 935 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:53:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2021-12-14 19:53:40,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 691. [2021-12-14 19:53:40,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 612 states have (on average 1.3611111111111112) internal successors, (833), 620 states have internal predecessors, (833), 56 states have call successors, (56), 23 states have call predecessors, (56), 22 states have return successors, (79), 48 states have call predecessors, (79), 49 states have call successors, (79) [2021-12-14 19:53:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 968 transitions. [2021-12-14 19:53:40,314 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 968 transitions. Word has length 35 [2021-12-14 19:53:40,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:40,314 INFO L470 AbstractCegarLoop]: Abstraction has 691 states and 968 transitions. [2021-12-14 19:53:40,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 968 transitions. [2021-12-14 19:53:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:53:40,315 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:40,315 INFO L514 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] [2021-12-14 19:53:40,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 19:53:40,316 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:40,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:40,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1698462691, now seen corresponding path program 1 times [2021-12-14 19:53:40,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:40,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330024317] [2021-12-14 19:53:40,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:40,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:40,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:53:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:40,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:40,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330024317] [2021-12-14 19:53:40,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330024317] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:40,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:40,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:53:40,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072314644] [2021-12-14 19:53:40,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:40,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:53:40,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:40,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:53:40,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:53:40,347 INFO L87 Difference]: Start difference. First operand 691 states and 968 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:40,478 INFO L93 Difference]: Finished difference Result 719 states and 1002 transitions. [2021-12-14 19:53:40,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:53:40,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-12-14 19:53:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:40,481 INFO L225 Difference]: With dead ends: 719 [2021-12-14 19:53:40,481 INFO L226 Difference]: Without dead ends: 706 [2021-12-14 19:53:40,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:53:40,482 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 85 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:40,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 1383 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:40,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2021-12-14 19:53:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 689. [2021-12-14 19:53:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 611 states have (on average 1.3600654664484453) internal successors, (831), 619 states have internal predecessors, (831), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (78), 47 states have call predecessors, (78), 48 states have call successors, (78) [2021-12-14 19:53:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 964 transitions. [2021-12-14 19:53:40,492 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 964 transitions. Word has length 35 [2021-12-14 19:53:40,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:40,492 INFO L470 AbstractCegarLoop]: Abstraction has 689 states and 964 transitions. [2021-12-14 19:53:40,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:40,493 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 964 transitions. [2021-12-14 19:53:40,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:53:40,493 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:40,494 INFO L514 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] [2021-12-14 19:53:40,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 19:53:40,494 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:40,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:40,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1261225060, now seen corresponding path program 1 times [2021-12-14 19:53:40,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:40,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889111004] [2021-12-14 19:53:40,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:40,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:40,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:40,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889111004] [2021-12-14 19:53:40,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889111004] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:40,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:40,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:53:40,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926397307] [2021-12-14 19:53:40,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:40,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:53:40,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:40,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:53:40,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:53:40,519 INFO L87 Difference]: Start difference. First operand 689 states and 964 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:40,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:40,546 INFO L93 Difference]: Finished difference Result 697 states and 975 transitions. [2021-12-14 19:53:40,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:53:40,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-14 19:53:40,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:40,548 INFO L225 Difference]: With dead ends: 697 [2021-12-14 19:53:40,548 INFO L226 Difference]: Without dead ends: 697 [2021-12-14 19:53:40,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:53:40,549 INFO L933 BasicCegarLoop]: 409 mSDtfsCounter, 5 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:40,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 766 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:53:40,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-12-14 19:53:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2021-12-14 19:53:40,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 619 states have (on average 1.3602584814216478) internal successors, (842), 627 states have internal predecessors, (842), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (78), 47 states have call predecessors, (78), 48 states have call successors, (78) [2021-12-14 19:53:40,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 975 transitions. [2021-12-14 19:53:40,559 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 975 transitions. Word has length 37 [2021-12-14 19:53:40,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:40,560 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 975 transitions. [2021-12-14 19:53:40,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:40,560 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 975 transitions. [2021-12-14 19:53:40,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 19:53:40,561 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:40,561 INFO L514 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-12-14 19:53:40,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-14 19:53:40,561 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:40,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:40,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1320764659, now seen corresponding path program 1 times [2021-12-14 19:53:40,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:40,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49304249] [2021-12-14 19:53:40,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:40,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:40,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-14 19:53:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:40,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:40,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:40,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49304249] [2021-12-14 19:53:40,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49304249] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:40,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:40,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:53:40,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117407442] [2021-12-14 19:53:40,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:40,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:53:40,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:40,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:53:40,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:53:40,594 INFO L87 Difference]: Start difference. First operand 697 states and 975 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:40,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:40,753 INFO L93 Difference]: Finished difference Result 719 states and 999 transitions. [2021-12-14 19:53:40,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:53:40,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-12-14 19:53:40,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:40,755 INFO L225 Difference]: With dead ends: 719 [2021-12-14 19:53:40,755 INFO L226 Difference]: Without dead ends: 704 [2021-12-14 19:53:40,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:40,756 INFO L933 BasicCegarLoop]: 403 mSDtfsCounter, 96 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:40,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 1705 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:40,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-12-14 19:53:40,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 697. [2021-12-14 19:53:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 619 states have (on average 1.3408723747980613) internal successors, (830), 627 states have internal predecessors, (830), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (78), 47 states have call predecessors, (78), 48 states have call successors, (78) [2021-12-14 19:53:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 963 transitions. [2021-12-14 19:53:40,766 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 963 transitions. Word has length 38 [2021-12-14 19:53:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:40,766 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 963 transitions. [2021-12-14 19:53:40,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 963 transitions. [2021-12-14 19:53:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 19:53:40,767 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:40,767 INFO L514 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-12-14 19:53:40,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-14 19:53:40,767 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:40,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:40,768 INFO L85 PathProgramCache]: Analyzing trace with hash -257120717, now seen corresponding path program 1 times [2021-12-14 19:53:40,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:40,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053011376] [2021-12-14 19:53:40,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:40,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:40,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:53:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:40,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:40,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053011376] [2021-12-14 19:53:40,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053011376] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:40,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:40,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:53:40,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681360835] [2021-12-14 19:53:40,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:40,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:53:40,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:40,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:53:40,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:53:40,821 INFO L87 Difference]: Start difference. First operand 697 states and 963 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:41,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:41,087 INFO L93 Difference]: Finished difference Result 717 states and 983 transitions. [2021-12-14 19:53:41,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:53:41,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-12-14 19:53:41,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:41,089 INFO L225 Difference]: With dead ends: 717 [2021-12-14 19:53:41,090 INFO L226 Difference]: Without dead ends: 717 [2021-12-14 19:53:41,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-12-14 19:53:41,090 INFO L933 BasicCegarLoop]: 378 mSDtfsCounter, 525 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:41,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [537 Valid, 1399 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-12-14 19:53:41,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 707. [2021-12-14 19:53:41,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 626 states have (on average 1.3354632587859425) internal successors, (836), 637 states have internal predecessors, (836), 55 states have call successors, (55), 23 states have call predecessors, (55), 25 states have return successors, (82), 47 states have call predecessors, (82), 48 states have call successors, (82) [2021-12-14 19:53:41,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 973 transitions. [2021-12-14 19:53:41,101 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 973 transitions. Word has length 38 [2021-12-14 19:53:41,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:41,101 INFO L470 AbstractCegarLoop]: Abstraction has 707 states and 973 transitions. [2021-12-14 19:53:41,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:41,101 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 973 transitions. [2021-12-14 19:53:41,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 19:53:41,102 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:41,102 INFO L514 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-12-14 19:53:41,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-14 19:53:41,102 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:41,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:41,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1775362044, now seen corresponding path program 1 times [2021-12-14 19:53:41,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:41,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912278943] [2021-12-14 19:53:41,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:41,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:41,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:53:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:41,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:41,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912278943] [2021-12-14 19:53:41,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912278943] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:41,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:41,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:53:41,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002816735] [2021-12-14 19:53:41,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:41,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:53:41,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:41,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:53:41,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:53:41,140 INFO L87 Difference]: Start difference. First operand 707 states and 973 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:41,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:41,303 INFO L93 Difference]: Finished difference Result 724 states and 990 transitions. [2021-12-14 19:53:41,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:53:41,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-12-14 19:53:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:41,307 INFO L225 Difference]: With dead ends: 724 [2021-12-14 19:53:41,307 INFO L226 Difference]: Without dead ends: 705 [2021-12-14 19:53:41,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:53:41,308 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 108 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:41,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 1987 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2021-12-14 19:53:41,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 699. [2021-12-14 19:53:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 619 states have (on average 1.3344103392568658) internal successors, (826), 630 states have internal predecessors, (826), 54 states have call successors, (54), 23 states have call predecessors, (54), 25 states have return successors, (81), 46 states have call predecessors, (81), 47 states have call successors, (81) [2021-12-14 19:53:41,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 961 transitions. [2021-12-14 19:53:41,318 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 961 transitions. Word has length 39 [2021-12-14 19:53:41,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:41,318 INFO L470 AbstractCegarLoop]: Abstraction has 699 states and 961 transitions. [2021-12-14 19:53:41,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:41,318 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 961 transitions. [2021-12-14 19:53:41,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 19:53:41,319 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:41,319 INFO L514 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-12-14 19:53:41,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-14 19:53:41,319 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:41,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:41,320 INFO L85 PathProgramCache]: Analyzing trace with hash 777524033, now seen corresponding path program 1 times [2021-12-14 19:53:41,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:41,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9282881] [2021-12-14 19:53:41,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:41,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:41,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:53:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:41,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:41,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9282881] [2021-12-14 19:53:41,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9282881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:41,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:41,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:53:41,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55464768] [2021-12-14 19:53:41,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:41,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:53:41,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:41,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:53:41,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:53:41,351 INFO L87 Difference]: Start difference. First operand 699 states and 961 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:41,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:41,509 INFO L93 Difference]: Finished difference Result 718 states and 981 transitions. [2021-12-14 19:53:41,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:53:41,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-12-14 19:53:41,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:41,512 INFO L225 Difference]: With dead ends: 718 [2021-12-14 19:53:41,512 INFO L226 Difference]: Without dead ends: 697 [2021-12-14 19:53:41,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:41,513 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 312 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:41,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 1338 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:41,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-12-14 19:53:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 691. [2021-12-14 19:53:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 611 states have (on average 1.3338788870703764) internal successors, (815), 622 states have internal predecessors, (815), 54 states have call successors, (54), 23 states have call predecessors, (54), 25 states have return successors, (81), 46 states have call predecessors, (81), 47 states have call successors, (81) [2021-12-14 19:53:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 950 transitions. [2021-12-14 19:53:41,522 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 950 transitions. Word has length 39 [2021-12-14 19:53:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:41,522 INFO L470 AbstractCegarLoop]: Abstraction has 691 states and 950 transitions. [2021-12-14 19:53:41,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 950 transitions. [2021-12-14 19:53:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 19:53:41,523 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:41,524 INFO L514 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-12-14 19:53:41,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-14 19:53:41,524 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:41,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:41,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1595982943, now seen corresponding path program 1 times [2021-12-14 19:53:41,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:41,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945921451] [2021-12-14 19:53:41,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:41,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:41,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:53:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:41,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:41,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945921451] [2021-12-14 19:53:41,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945921451] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:41,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:41,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:53:41,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923680641] [2021-12-14 19:53:41,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:41,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:53:41,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:41,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:53:41,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:53:41,565 INFO L87 Difference]: Start difference. First operand 691 states and 950 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:41,774 INFO L93 Difference]: Finished difference Result 711 states and 972 transitions. [2021-12-14 19:53:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:53:41,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-12-14 19:53:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:41,777 INFO L225 Difference]: With dead ends: 711 [2021-12-14 19:53:41,777 INFO L226 Difference]: Without dead ends: 711 [2021-12-14 19:53:41,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:41,778 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 84 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:41,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 1859 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2021-12-14 19:53:41,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 696. [2021-12-14 19:53:41,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 615 states have (on average 1.3317073170731708) internal successors, (819), 626 states have internal predecessors, (819), 54 states have call successors, (54), 23 states have call predecessors, (54), 26 states have return successors, (83), 47 states have call predecessors, (83), 47 states have call successors, (83) [2021-12-14 19:53:41,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 956 transitions. [2021-12-14 19:53:41,788 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 956 transitions. Word has length 39 [2021-12-14 19:53:41,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:41,788 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 956 transitions. [2021-12-14 19:53:41,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:41,789 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 956 transitions. [2021-12-14 19:53:41,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 19:53:41,789 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:41,789 INFO L514 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-12-14 19:53:41,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-14 19:53:41,790 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:41,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:41,790 INFO L85 PathProgramCache]: Analyzing trace with hash -398634571, now seen corresponding path program 1 times [2021-12-14 19:53:41,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:41,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698557207] [2021-12-14 19:53:41,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:41,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:41,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 19:53:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:41,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:41,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:41,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698557207] [2021-12-14 19:53:41,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698557207] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:41,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:41,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:53:41,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120440616] [2021-12-14 19:53:41,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:41,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:53:41,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:41,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:53:41,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:53:41,821 INFO L87 Difference]: Start difference. First operand 696 states and 956 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:42,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:42,003 INFO L93 Difference]: Finished difference Result 518 states and 681 transitions. [2021-12-14 19:53:42,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:53:42,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-12-14 19:53:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:42,005 INFO L225 Difference]: With dead ends: 518 [2021-12-14 19:53:42,005 INFO L226 Difference]: Without dead ends: 518 [2021-12-14 19:53:42,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:53:42,005 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 485 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:42,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 955 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:42,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-12-14 19:53:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 477. [2021-12-14 19:53:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 418 states have (on average 1.299043062200957) internal successors, (543), 428 states have internal predecessors, (543), 39 states have call successors, (39), 16 states have call predecessors, (39), 19 states have return successors, (47), 33 states have call predecessors, (47), 32 states have call successors, (47) [2021-12-14 19:53:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 629 transitions. [2021-12-14 19:53:42,013 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 629 transitions. Word has length 41 [2021-12-14 19:53:42,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:42,013 INFO L470 AbstractCegarLoop]: Abstraction has 477 states and 629 transitions. [2021-12-14 19:53:42,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 629 transitions. [2021-12-14 19:53:42,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 19:53:42,014 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:42,014 INFO L514 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-12-14 19:53:42,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-14 19:53:42,014 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:42,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1554772088, now seen corresponding path program 1 times [2021-12-14 19:53:42,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:42,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318436243] [2021-12-14 19:53:42,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:42,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:42,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:53:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:42,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:42,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318436243] [2021-12-14 19:53:42,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318436243] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:42,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:42,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:53:42,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758832003] [2021-12-14 19:53:42,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:42,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:53:42,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:42,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:53:42,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:53:42,043 INFO L87 Difference]: Start difference. First operand 477 states and 629 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:42,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:42,189 INFO L93 Difference]: Finished difference Result 607 states and 796 transitions. [2021-12-14 19:53:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:53:42,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-12-14 19:53:42,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:42,192 INFO L225 Difference]: With dead ends: 607 [2021-12-14 19:53:42,192 INFO L226 Difference]: Without dead ends: 591 [2021-12-14 19:53:42,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:53:42,192 INFO L933 BasicCegarLoop]: 425 mSDtfsCounter, 180 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:42,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 971 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:42,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-12-14 19:53:42,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 531. [2021-12-14 19:53:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 466 states have (on average 1.2918454935622317) internal successors, (602), 470 states have internal predecessors, (602), 41 states have call successors, (41), 18 states have call predecessors, (41), 23 states have return successors, (59), 43 states have call predecessors, (59), 34 states have call successors, (59) [2021-12-14 19:53:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 702 transitions. [2021-12-14 19:53:42,200 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 702 transitions. Word has length 40 [2021-12-14 19:53:42,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:42,201 INFO L470 AbstractCegarLoop]: Abstraction has 531 states and 702 transitions. [2021-12-14 19:53:42,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 702 transitions. [2021-12-14 19:53:42,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 19:53:42,202 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:42,202 INFO L514 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-12-14 19:53:42,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-14 19:53:42,202 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:42,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:42,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2126401672, now seen corresponding path program 1 times [2021-12-14 19:53:42,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:42,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558745305] [2021-12-14 19:53:42,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:42,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:42,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:53:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:42,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:42,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558745305] [2021-12-14 19:53:42,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558745305] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:42,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:42,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:53:42,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433463808] [2021-12-14 19:53:42,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:42,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:53:42,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:42,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:53:42,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:53:42,249 INFO L87 Difference]: Start difference. First operand 531 states and 702 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:42,478 INFO L93 Difference]: Finished difference Result 523 states and 696 transitions. [2021-12-14 19:53:42,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:53:42,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-12-14 19:53:42,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:42,480 INFO L225 Difference]: With dead ends: 523 [2021-12-14 19:53:42,480 INFO L226 Difference]: Without dead ends: 482 [2021-12-14 19:53:42,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:53:42,481 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 454 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:42,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [462 Valid, 1065 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:42,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-12-14 19:53:42,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 455. [2021-12-14 19:53:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 398 states have (on average 1.3115577889447236) internal successors, (522), 409 states have internal predecessors, (522), 38 states have call successors, (38), 15 states have call predecessors, (38), 18 states have return successors, (47), 31 states have call predecessors, (47), 31 states have call successors, (47) [2021-12-14 19:53:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 607 transitions. [2021-12-14 19:53:42,488 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 607 transitions. Word has length 40 [2021-12-14 19:53:42,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:42,488 INFO L470 AbstractCegarLoop]: Abstraction has 455 states and 607 transitions. [2021-12-14 19:53:42,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:42,488 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 607 transitions. [2021-12-14 19:53:42,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 19:53:42,489 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:42,489 INFO L514 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-12-14 19:53:42,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-14 19:53:42,497 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:42,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:42,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1405383092, now seen corresponding path program 1 times [2021-12-14 19:53:42,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:42,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071513453] [2021-12-14 19:53:42,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:42,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:42,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:53:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:42,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:42,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071513453] [2021-12-14 19:53:42,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071513453] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:42,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:42,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:53:42,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251018413] [2021-12-14 19:53:42,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:42,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:53:42,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:42,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:53:42,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:42,545 INFO L87 Difference]: Start difference. First operand 455 states and 607 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:42,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:42,756 INFO L93 Difference]: Finished difference Result 500 states and 670 transitions. [2021-12-14 19:53:42,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:53:42,757 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-12-14 19:53:42,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:42,758 INFO L225 Difference]: With dead ends: 500 [2021-12-14 19:53:42,758 INFO L226 Difference]: Without dead ends: 499 [2021-12-14 19:53:42,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:53:42,760 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 287 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:42,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 1854 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:42,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2021-12-14 19:53:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 470. [2021-12-14 19:53:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 412 states have (on average 1.3009708737864079) internal successors, (536), 423 states have internal predecessors, (536), 38 states have call successors, (38), 15 states have call predecessors, (38), 19 states have return successors, (55), 32 states have call predecessors, (55), 31 states have call successors, (55) [2021-12-14 19:53:42,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 629 transitions. [2021-12-14 19:53:42,769 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 629 transitions. Word has length 41 [2021-12-14 19:53:42,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:42,769 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 629 transitions. [2021-12-14 19:53:42,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:42,769 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 629 transitions. [2021-12-14 19:53:42,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 19:53:42,770 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:42,770 INFO L514 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-12-14 19:53:42,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-14 19:53:42,770 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:42,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:42,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1405659922, now seen corresponding path program 1 times [2021-12-14 19:53:42,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:42,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236640729] [2021-12-14 19:53:42,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:42,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:42,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:53:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:42,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:42,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236640729] [2021-12-14 19:53:42,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236640729] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:42,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:42,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:53:42,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754801295] [2021-12-14 19:53:42,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:42,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:53:42,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:42,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:53:42,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:42,816 INFO L87 Difference]: Start difference. First operand 470 states and 629 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:43,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:43,060 INFO L93 Difference]: Finished difference Result 487 states and 647 transitions. [2021-12-14 19:53:43,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:53:43,061 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-12-14 19:53:43,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:43,062 INFO L225 Difference]: With dead ends: 487 [2021-12-14 19:53:43,062 INFO L226 Difference]: Without dead ends: 477 [2021-12-14 19:53:43,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:53:43,063 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 78 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:43,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 1943 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2021-12-14 19:53:43,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 467. [2021-12-14 19:53:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 409 states have (on average 1.3031784841075795) internal successors, (533), 421 states have internal predecessors, (533), 38 states have call successors, (38), 15 states have call predecessors, (38), 19 states have return successors, (54), 31 states have call predecessors, (54), 31 states have call successors, (54) [2021-12-14 19:53:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 625 transitions. [2021-12-14 19:53:43,070 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 625 transitions. Word has length 41 [2021-12-14 19:53:43,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:43,070 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 625 transitions. [2021-12-14 19:53:43,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:43,070 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 625 transitions. [2021-12-14 19:53:43,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 19:53:43,073 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:43,073 INFO L514 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-12-14 19:53:43,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-14 19:53:43,073 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:43,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:43,073 INFO L85 PathProgramCache]: Analyzing trace with hash 188020548, now seen corresponding path program 1 times [2021-12-14 19:53:43,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:43,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881703759] [2021-12-14 19:53:43,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:43,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:43,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:53:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:43,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:43,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881703759] [2021-12-14 19:53:43,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881703759] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:43,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:43,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:53:43,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799906926] [2021-12-14 19:53:43,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:43,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:53:43,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:43,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:53:43,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:53:43,120 INFO L87 Difference]: Start difference. First operand 467 states and 625 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:43,368 INFO L93 Difference]: Finished difference Result 523 states and 694 transitions. [2021-12-14 19:53:43,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:53:43,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2021-12-14 19:53:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:43,370 INFO L225 Difference]: With dead ends: 523 [2021-12-14 19:53:43,370 INFO L226 Difference]: Without dead ends: 511 [2021-12-14 19:53:43,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:53:43,371 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 607 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:43,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [619 Valid, 1096 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-12-14 19:53:43,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 453. [2021-12-14 19:53:43,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 397 states have (on average 1.309823677581864) internal successors, (520), 408 states have internal predecessors, (520), 37 states have call successors, (37), 15 states have call predecessors, (37), 18 states have return successors, (46), 30 states have call predecessors, (46), 30 states have call successors, (46) [2021-12-14 19:53:43,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 603 transitions. [2021-12-14 19:53:43,377 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 603 transitions. Word has length 42 [2021-12-14 19:53:43,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:43,377 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 603 transitions. [2021-12-14 19:53:43,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 603 transitions. [2021-12-14 19:53:43,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-14 19:53:43,378 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:43,378 INFO L514 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-12-14 19:53:43,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-14 19:53:43,378 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:43,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:43,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1315082489, now seen corresponding path program 1 times [2021-12-14 19:53:43,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:43,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157568971] [2021-12-14 19:53:43,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:43,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:43,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 19:53:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:43,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:43,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157568971] [2021-12-14 19:53:43,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157568971] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:43,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:43,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:53:43,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967721142] [2021-12-14 19:53:43,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:43,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:53:43,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:43,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:53:43,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:53:43,480 INFO L87 Difference]: Start difference. First operand 453 states and 603 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:43,650 INFO L93 Difference]: Finished difference Result 413 states and 544 transitions. [2021-12-14 19:53:43,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:53:43,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-12-14 19:53:43,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:43,652 INFO L225 Difference]: With dead ends: 413 [2021-12-14 19:53:43,652 INFO L226 Difference]: Without dead ends: 413 [2021-12-14 19:53:43,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:43,652 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 102 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:43,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 1795 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-12-14 19:53:43,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 407. [2021-12-14 19:53:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 357 states have (on average 1.2913165266106443) internal successors, (461), 364 states have internal predecessors, (461), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (41), 29 states have call predecessors, (41), 29 states have call successors, (41) [2021-12-14 19:53:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 537 transitions. [2021-12-14 19:53:43,658 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 537 transitions. Word has length 44 [2021-12-14 19:53:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:43,658 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 537 transitions. [2021-12-14 19:53:43,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 537 transitions. [2021-12-14 19:53:43,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-14 19:53:43,659 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:43,659 INFO L514 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-12-14 19:53:43,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-14 19:53:43,660 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash 817778302, now seen corresponding path program 1 times [2021-12-14 19:53:43,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:43,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118796390] [2021-12-14 19:53:43,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:43,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:43,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 19:53:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:43,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:43,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:43,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118796390] [2021-12-14 19:53:43,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118796390] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:43,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:43,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:53:43,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403751890] [2021-12-14 19:53:43,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:43,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:53:43,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:43,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:53:43,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:53:43,729 INFO L87 Difference]: Start difference. First operand 407 states and 537 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:43,973 INFO L93 Difference]: Finished difference Result 413 states and 542 transitions. [2021-12-14 19:53:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:53:43,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-12-14 19:53:43,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:43,974 INFO L225 Difference]: With dead ends: 413 [2021-12-14 19:53:43,974 INFO L226 Difference]: Without dead ends: 413 [2021-12-14 19:53:43,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:53:43,975 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 397 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:43,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [401 Valid, 1031 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:43,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-12-14 19:53:43,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 407. [2021-12-14 19:53:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 357 states have (on average 1.2857142857142858) internal successors, (459), 364 states have internal predecessors, (459), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (41), 29 states have call predecessors, (41), 29 states have call successors, (41) [2021-12-14 19:53:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 535 transitions. [2021-12-14 19:53:43,980 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 535 transitions. Word has length 46 [2021-12-14 19:53:43,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:43,980 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 535 transitions. [2021-12-14 19:53:43,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:43,981 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 535 transitions. [2021-12-14 19:53:43,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-14 19:53:43,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:43,981 INFO L514 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-12-14 19:53:43,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-14 19:53:43,981 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:43,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:43,982 INFO L85 PathProgramCache]: Analyzing trace with hash 351110669, now seen corresponding path program 1 times [2021-12-14 19:53:43,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:43,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242661189] [2021-12-14 19:53:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:43,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:44,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:53:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:44,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:44,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242661189] [2021-12-14 19:53:44,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242661189] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:44,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:44,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:53:44,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474616873] [2021-12-14 19:53:44,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:44,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:53:44,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:44,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:53:44,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:44,037 INFO L87 Difference]: Start difference. First operand 407 states and 535 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:44,271 INFO L93 Difference]: Finished difference Result 422 states and 550 transitions. [2021-12-14 19:53:44,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:53:44,271 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-12-14 19:53:44,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:44,272 INFO L225 Difference]: With dead ends: 422 [2021-12-14 19:53:44,273 INFO L226 Difference]: Without dead ends: 409 [2021-12-14 19:53:44,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:53:44,273 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 74 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:44,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 1931 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-12-14 19:53:44,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 403. [2021-12-14 19:53:44,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 354 states have (on average 1.2853107344632768) internal successors, (455), 361 states have internal predecessors, (455), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (40), 28 states have call predecessors, (40), 28 states have call successors, (40) [2021-12-14 19:53:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 529 transitions. [2021-12-14 19:53:44,278 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 529 transitions. Word has length 46 [2021-12-14 19:53:44,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:44,278 INFO L470 AbstractCegarLoop]: Abstraction has 403 states and 529 transitions. [2021-12-14 19:53:44,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 529 transitions. [2021-12-14 19:53:44,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-14 19:53:44,279 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:44,279 INFO L514 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-12-14 19:53:44,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-14 19:53:44,279 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:44,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:44,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2022690400, now seen corresponding path program 1 times [2021-12-14 19:53:44,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:44,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020584189] [2021-12-14 19:53:44,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:44,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:44,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:53:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:44,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-14 19:53:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:44,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:44,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020584189] [2021-12-14 19:53:44,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020584189] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:44,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:44,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:53:44,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890391420] [2021-12-14 19:53:44,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:44,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:53:44,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:44,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:53:44,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:53:44,331 INFO L87 Difference]: Start difference. First operand 403 states and 529 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:53:44,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:44,689 INFO L93 Difference]: Finished difference Result 422 states and 549 transitions. [2021-12-14 19:53:44,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:53:44,690 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2021-12-14 19:53:44,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:44,691 INFO L225 Difference]: With dead ends: 422 [2021-12-14 19:53:44,691 INFO L226 Difference]: Without dead ends: 404 [2021-12-14 19:53:44,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:53:44,692 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 148 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:44,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 2084 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:53:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-12-14 19:53:44,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 398. [2021-12-14 19:53:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 349 states have (on average 1.2836676217765044) internal successors, (448), 357 states have internal predecessors, (448), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (39), 27 states have call predecessors, (39), 28 states have call successors, (39) [2021-12-14 19:53:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 521 transitions. [2021-12-14 19:53:44,698 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 521 transitions. Word has length 47 [2021-12-14 19:53:44,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:44,698 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 521 transitions. [2021-12-14 19:53:44,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:53:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 521 transitions. [2021-12-14 19:53:44,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-14 19:53:44,699 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:44,699 INFO L514 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-12-14 19:53:44,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-14 19:53:44,699 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:44,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2034007966, now seen corresponding path program 1 times [2021-12-14 19:53:44,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:44,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592696450] [2021-12-14 19:53:44,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:44,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:44,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:53:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:44,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 19:53:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:44,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:44,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592696450] [2021-12-14 19:53:44,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592696450] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:44,738 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:44,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:53:44,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782251028] [2021-12-14 19:53:44,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:44,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:53:44,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:44,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:53:44,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:53:44,738 INFO L87 Difference]: Start difference. First operand 398 states and 521 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:53:44,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:44,982 INFO L93 Difference]: Finished difference Result 418 states and 542 transitions. [2021-12-14 19:53:44,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:53:44,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2021-12-14 19:53:44,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:44,984 INFO L225 Difference]: With dead ends: 418 [2021-12-14 19:53:44,984 INFO L226 Difference]: Without dead ends: 403 [2021-12-14 19:53:44,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:53:44,985 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 148 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:44,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 1491 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:44,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-12-14 19:53:44,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 397. [2021-12-14 19:53:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 349 states have (on average 1.2808022922636104) internal successors, (447), 356 states have internal predecessors, (447), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (38), 27 states have call predecessors, (38), 27 states have call successors, (38) [2021-12-14 19:53:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 518 transitions. [2021-12-14 19:53:44,990 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 518 transitions. Word has length 48 [2021-12-14 19:53:44,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:44,991 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 518 transitions. [2021-12-14 19:53:44,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:53:44,991 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 518 transitions. [2021-12-14 19:53:44,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-14 19:53:44,991 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:44,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:53:44,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-14 19:53:44,992 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:44,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:44,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1900155685, now seen corresponding path program 1 times [2021-12-14 19:53:44,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:44,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850804684] [2021-12-14 19:53:44,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:44,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:45,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 19:53:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:45,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:45,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850804684] [2021-12-14 19:53:45,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850804684] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:45,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:45,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:53:45,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18692962] [2021-12-14 19:53:45,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:45,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:53:45,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:45,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:53:45,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:53:45,031 INFO L87 Difference]: Start difference. First operand 397 states and 518 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:45,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:45,177 INFO L93 Difference]: Finished difference Result 482 states and 622 transitions. [2021-12-14 19:53:45,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:53:45,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2021-12-14 19:53:45,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:45,179 INFO L225 Difference]: With dead ends: 482 [2021-12-14 19:53:45,179 INFO L226 Difference]: Without dead ends: 482 [2021-12-14 19:53:45,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:53:45,180 INFO L933 BasicCegarLoop]: 384 mSDtfsCounter, 188 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:45,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 859 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:45,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-12-14 19:53:45,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 450. [2021-12-14 19:53:45,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 397 states have (on average 1.279596977329975) internal successors, (508), 403 states have internal predecessors, (508), 35 states have call successors, (35), 16 states have call predecessors, (35), 17 states have return successors, (44), 31 states have call predecessors, (44), 30 states have call successors, (44) [2021-12-14 19:53:45,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 587 transitions. [2021-12-14 19:53:45,188 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 587 transitions. Word has length 49 [2021-12-14 19:53:45,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:45,188 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 587 transitions. [2021-12-14 19:53:45,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:45,188 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 587 transitions. [2021-12-14 19:53:45,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-14 19:53:45,189 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:45,189 INFO L514 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-12-14 19:53:45,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-14 19:53:45,189 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:45,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:45,189 INFO L85 PathProgramCache]: Analyzing trace with hash 785908469, now seen corresponding path program 1 times [2021-12-14 19:53:45,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:45,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714232887] [2021-12-14 19:53:45,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:45,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:45,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:53:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:45,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:45,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714232887] [2021-12-14 19:53:45,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714232887] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:45,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:45,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:53:45,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067813145] [2021-12-14 19:53:45,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:45,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:53:45,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:45,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:53:45,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:53:45,224 INFO L87 Difference]: Start difference. First operand 450 states and 587 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:45,354 INFO L93 Difference]: Finished difference Result 463 states and 603 transitions. [2021-12-14 19:53:45,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:53:45,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2021-12-14 19:53:45,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:45,355 INFO L225 Difference]: With dead ends: 463 [2021-12-14 19:53:45,356 INFO L226 Difference]: Without dead ends: 463 [2021-12-14 19:53:45,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:53:45,356 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 70 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:45,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 1105 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:45,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-12-14 19:53:45,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 452. [2021-12-14 19:53:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 399 states have (on average 1.2781954887218046) internal successors, (510), 405 states have internal predecessors, (510), 35 states have call successors, (35), 16 states have call predecessors, (35), 17 states have return successors, (44), 31 states have call predecessors, (44), 30 states have call successors, (44) [2021-12-14 19:53:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 589 transitions. [2021-12-14 19:53:45,362 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 589 transitions. Word has length 48 [2021-12-14 19:53:45,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:45,362 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 589 transitions. [2021-12-14 19:53:45,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:45,362 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 589 transitions. [2021-12-14 19:53:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-14 19:53:45,363 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:45,363 INFO L514 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-12-14 19:53:45,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-14 19:53:45,363 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:45,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:45,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1427465013, now seen corresponding path program 1 times [2021-12-14 19:53:45,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:45,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642267005] [2021-12-14 19:53:45,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:45,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:45,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:53:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:45,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:45,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642267005] [2021-12-14 19:53:45,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642267005] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:45,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:45,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:53:45,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617483302] [2021-12-14 19:53:45,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:45,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:53:45,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:45,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:53:45,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:45,412 INFO L87 Difference]: Start difference. First operand 452 states and 589 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:45,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:45,602 INFO L93 Difference]: Finished difference Result 451 states and 583 transitions. [2021-12-14 19:53:45,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:53:45,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2021-12-14 19:53:45,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:45,604 INFO L225 Difference]: With dead ends: 451 [2021-12-14 19:53:45,604 INFO L226 Difference]: Without dead ends: 451 [2021-12-14 19:53:45,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:53:45,604 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 81 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:45,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 1916 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:45,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-12-14 19:53:45,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 440. [2021-12-14 19:53:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 388 states have (on average 1.2731958762886597) internal successors, (494), 393 states have internal predecessors, (494), 34 states have call successors, (34), 16 states have call predecessors, (34), 17 states have return successors, (44), 31 states have call predecessors, (44), 30 states have call successors, (44) [2021-12-14 19:53:45,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 572 transitions. [2021-12-14 19:53:45,610 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 572 transitions. Word has length 48 [2021-12-14 19:53:45,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:45,610 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 572 transitions. [2021-12-14 19:53:45,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:45,611 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 572 transitions. [2021-12-14 19:53:45,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-14 19:53:45,611 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:45,611 INFO L514 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-12-14 19:53:45,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-14 19:53:45,612 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:45,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:45,612 INFO L85 PathProgramCache]: Analyzing trace with hash 827652383, now seen corresponding path program 1 times [2021-12-14 19:53:45,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:45,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596012213] [2021-12-14 19:53:45,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:45,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:45,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 19:53:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:45,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:45,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596012213] [2021-12-14 19:53:45,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596012213] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:45,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:45,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:53:45,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284352098] [2021-12-14 19:53:45,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:45,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:53:45,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:45,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:53:45,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:53:45,668 INFO L87 Difference]: Start difference. First operand 440 states and 572 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:45,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:45,848 INFO L93 Difference]: Finished difference Result 469 states and 607 transitions. [2021-12-14 19:53:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:53:45,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2021-12-14 19:53:45,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:45,850 INFO L225 Difference]: With dead ends: 469 [2021-12-14 19:53:45,850 INFO L226 Difference]: Without dead ends: 469 [2021-12-14 19:53:45,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:53:45,851 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 81 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:45,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 1819 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2021-12-14 19:53:45,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 440. [2021-12-14 19:53:45,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 388 states have (on average 1.268041237113402) internal successors, (492), 393 states have internal predecessors, (492), 34 states have call successors, (34), 16 states have call predecessors, (34), 17 states have return successors, (44), 31 states have call predecessors, (44), 30 states have call successors, (44) [2021-12-14 19:53:45,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 570 transitions. [2021-12-14 19:53:45,856 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 570 transitions. Word has length 51 [2021-12-14 19:53:45,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:45,857 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 570 transitions. [2021-12-14 19:53:45,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:45,857 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 570 transitions. [2021-12-14 19:53:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-14 19:53:45,857 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:45,857 INFO L514 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-12-14 19:53:45,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-14 19:53:45,858 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:45,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:45,858 INFO L85 PathProgramCache]: Analyzing trace with hash 141980076, now seen corresponding path program 1 times [2021-12-14 19:53:45,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:45,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028149490] [2021-12-14 19:53:45,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:45,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:45,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-14 19:53:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:45,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:45,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028149490] [2021-12-14 19:53:45,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028149490] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:45,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:45,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:53:45,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462876150] [2021-12-14 19:53:45,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:45,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:53:45,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:45,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:53:45,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:53:45,910 INFO L87 Difference]: Start difference. First operand 440 states and 570 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:46,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:46,163 INFO L93 Difference]: Finished difference Result 458 states and 589 transitions. [2021-12-14 19:53:46,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:53:46,163 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2021-12-14 19:53:46,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:46,165 INFO L225 Difference]: With dead ends: 458 [2021-12-14 19:53:46,165 INFO L226 Difference]: Without dead ends: 442 [2021-12-14 19:53:46,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:53:46,165 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 82 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:46,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 2040 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:46,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2021-12-14 19:53:46,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 436. [2021-12-14 19:53:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 385 states have (on average 1.2675324675324675) internal successors, (488), 390 states have internal predecessors, (488), 33 states have call successors, (33), 16 states have call predecessors, (33), 17 states have return successors, (43), 30 states have call predecessors, (43), 29 states have call successors, (43) [2021-12-14 19:53:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 564 transitions. [2021-12-14 19:53:46,170 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 564 transitions. Word has length 51 [2021-12-14 19:53:46,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:46,171 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 564 transitions. [2021-12-14 19:53:46,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 564 transitions. [2021-12-14 19:53:46,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-14 19:53:46,171 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:46,171 INFO L514 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-12-14 19:53:46,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-14 19:53:46,172 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:46,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:46,172 INFO L85 PathProgramCache]: Analyzing trace with hash -646852178, now seen corresponding path program 1 times [2021-12-14 19:53:46,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:46,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742031929] [2021-12-14 19:53:46,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:46,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:46,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 19:53:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:46,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-12-14 19:53:46,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:46,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742031929] [2021-12-14 19:53:46,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742031929] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:46,214 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:46,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:53:46,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593718978] [2021-12-14 19:53:46,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:46,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:53:46,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:46,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:53:46,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:53:46,216 INFO L87 Difference]: Start difference. First operand 436 states and 564 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:46,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:46,466 INFO L93 Difference]: Finished difference Result 454 states and 583 transitions. [2021-12-14 19:53:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:53:46,466 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2021-12-14 19:53:46,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:46,468 INFO L225 Difference]: With dead ends: 454 [2021-12-14 19:53:46,468 INFO L226 Difference]: Without dead ends: 437 [2021-12-14 19:53:46,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:53:46,468 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 82 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 2066 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:46,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 2066 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:46,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-12-14 19:53:46,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 431. [2021-12-14 19:53:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 381 states have (on average 1.2677165354330708) internal successors, (483), 386 states have internal predecessors, (483), 32 states have call successors, (32), 16 states have call predecessors, (32), 17 states have return successors, (42), 29 states have call predecessors, (42), 28 states have call successors, (42) [2021-12-14 19:53:46,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 557 transitions. [2021-12-14 19:53:46,473 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 557 transitions. Word has length 52 [2021-12-14 19:53:46,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:46,473 INFO L470 AbstractCegarLoop]: Abstraction has 431 states and 557 transitions. [2021-12-14 19:53:46,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:46,474 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 557 transitions. [2021-12-14 19:53:46,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-14 19:53:46,474 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:46,474 INFO L514 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-12-14 19:53:46,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-12-14 19:53:46,474 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:46,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:46,475 INFO L85 PathProgramCache]: Analyzing trace with hash -403973580, now seen corresponding path program 1 times [2021-12-14 19:53:46,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:46,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150372706] [2021-12-14 19:53:46,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:46,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:46,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 19:53:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:46,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:46,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150372706] [2021-12-14 19:53:46,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150372706] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:46,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:46,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:53:46,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815242154] [2021-12-14 19:53:46,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:46,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:53:46,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:46,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:53:46,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:53:46,521 INFO L87 Difference]: Start difference. First operand 431 states and 557 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:46,777 INFO L93 Difference]: Finished difference Result 449 states and 576 transitions. [2021-12-14 19:53:46,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:53:46,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2021-12-14 19:53:46,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:46,778 INFO L225 Difference]: With dead ends: 449 [2021-12-14 19:53:46,779 INFO L226 Difference]: Without dead ends: 433 [2021-12-14 19:53:46,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:53:46,779 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 82 mSDsluCounter, 1644 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:46,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 1956 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:46,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-12-14 19:53:46,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 427. [2021-12-14 19:53:46,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 378 states have (on average 1.2671957671957672) internal successors, (479), 383 states have internal predecessors, (479), 31 states have call successors, (31), 16 states have call predecessors, (31), 17 states have return successors, (41), 28 states have call predecessors, (41), 27 states have call successors, (41) [2021-12-14 19:53:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 551 transitions. [2021-12-14 19:53:46,785 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 551 transitions. Word has length 52 [2021-12-14 19:53:46,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:46,785 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 551 transitions. [2021-12-14 19:53:46,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 551 transitions. [2021-12-14 19:53:46,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-14 19:53:46,786 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:46,786 INFO L514 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-12-14 19:53:46,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-12-14 19:53:46,786 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:46,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash 515113277, now seen corresponding path program 1 times [2021-12-14 19:53:46,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:46,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982157389] [2021-12-14 19:53:46,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:46,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:46,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-14 19:53:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:46,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:46,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982157389] [2021-12-14 19:53:46,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982157389] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:46,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:46,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:53:46,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634605607] [2021-12-14 19:53:46,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:46,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:53:46,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:46,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:53:46,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:46,836 INFO L87 Difference]: Start difference. First operand 427 states and 551 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:47,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:47,045 INFO L93 Difference]: Finished difference Result 441 states and 565 transitions. [2021-12-14 19:53:47,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:53:47,046 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2021-12-14 19:53:47,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:47,047 INFO L225 Difference]: With dead ends: 441 [2021-12-14 19:53:47,047 INFO L226 Difference]: Without dead ends: 424 [2021-12-14 19:53:47,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:53:47,048 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 72 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:47,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 1778 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:47,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-12-14 19:53:47,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 418. [2021-12-14 19:53:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 370 states have (on average 1.2648648648648648) internal successors, (468), 375 states have internal predecessors, (468), 30 states have call successors, (30), 16 states have call predecessors, (30), 17 states have return successors, (40), 27 states have call predecessors, (40), 26 states have call successors, (40) [2021-12-14 19:53:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 538 transitions. [2021-12-14 19:53:47,053 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 538 transitions. Word has length 52 [2021-12-14 19:53:47,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:47,053 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 538 transitions. [2021-12-14 19:53:47,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:47,053 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 538 transitions. [2021-12-14 19:53:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-14 19:53:47,054 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:47,054 INFO L514 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-12-14 19:53:47,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-12-14 19:53:47,054 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:47,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:47,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1195477270, now seen corresponding path program 1 times [2021-12-14 19:53:47,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:47,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409451935] [2021-12-14 19:53:47,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:47,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:47,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 19:53:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:47,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:47,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:47,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409451935] [2021-12-14 19:53:47,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409451935] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:47,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:47,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:53:47,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136326456] [2021-12-14 19:53:47,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:47,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:53:47,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:47,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:53:47,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:53:47,115 INFO L87 Difference]: Start difference. First operand 418 states and 538 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:47,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:47,294 INFO L93 Difference]: Finished difference Result 550 states and 725 transitions. [2021-12-14 19:53:47,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:53:47,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2021-12-14 19:53:47,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:47,296 INFO L225 Difference]: With dead ends: 550 [2021-12-14 19:53:47,296 INFO L226 Difference]: Without dead ends: 550 [2021-12-14 19:53:47,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:53:47,296 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 133 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:47,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 1931 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:47,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-12-14 19:53:47,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 418. [2021-12-14 19:53:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 370 states have (on average 1.2621621621621621) internal successors, (467), 375 states have internal predecessors, (467), 30 states have call successors, (30), 16 states have call predecessors, (30), 17 states have return successors, (40), 27 states have call predecessors, (40), 26 states have call successors, (40) [2021-12-14 19:53:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 537 transitions. [2021-12-14 19:53:47,303 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 537 transitions. Word has length 54 [2021-12-14 19:53:47,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:47,303 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 537 transitions. [2021-12-14 19:53:47,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:47,303 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 537 transitions. [2021-12-14 19:53:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-14 19:53:47,304 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:47,304 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:53:47,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-12-14 19:53:47,304 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:47,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:47,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1153490444, now seen corresponding path program 1 times [2021-12-14 19:53:47,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:47,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316005863] [2021-12-14 19:53:47,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:47,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:47,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:53:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:47,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 19:53:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:47,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:47,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:47,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316005863] [2021-12-14 19:53:47,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316005863] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:47,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:47,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:53:47,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651356111] [2021-12-14 19:53:47,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:47,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:53:47,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:47,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:53:47,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:53:47,368 INFO L87 Difference]: Start difference. First operand 418 states and 537 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:53:47,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:47,710 INFO L93 Difference]: Finished difference Result 434 states and 553 transitions. [2021-12-14 19:53:47,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:53:47,710 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2021-12-14 19:53:47,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:47,711 INFO L225 Difference]: With dead ends: 434 [2021-12-14 19:53:47,711 INFO L226 Difference]: Without dead ends: 390 [2021-12-14 19:53:47,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:53:47,712 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 137 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:47,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 1949 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:53:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-12-14 19:53:47,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 382. [2021-12-14 19:53:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 338 states have (on average 1.257396449704142) internal successors, (425), 342 states have internal predecessors, (425), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (37), 25 states have call predecessors, (37), 24 states have call successors, (37) [2021-12-14 19:53:47,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 490 transitions. [2021-12-14 19:53:47,716 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 490 transitions. Word has length 56 [2021-12-14 19:53:47,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:47,717 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 490 transitions. [2021-12-14 19:53:47,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:53:47,717 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 490 transitions. [2021-12-14 19:53:47,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-14 19:53:47,717 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:47,717 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:53:47,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-12-14 19:53:47,718 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:47,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:47,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1693203453, now seen corresponding path program 1 times [2021-12-14 19:53:47,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:47,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384801571] [2021-12-14 19:53:47,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:47,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:47,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:53:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:47,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:47,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384801571] [2021-12-14 19:53:47,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384801571] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:47,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:47,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:53:47,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391533199] [2021-12-14 19:53:47,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:47,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:53:47,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:47,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:53:47,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:53:47,776 INFO L87 Difference]: Start difference. First operand 382 states and 490 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:48,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:48,024 INFO L93 Difference]: Finished difference Result 400 states and 509 transitions. [2021-12-14 19:53:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:53:48,024 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2021-12-14 19:53:48,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:48,025 INFO L225 Difference]: With dead ends: 400 [2021-12-14 19:53:48,026 INFO L226 Difference]: Without dead ends: 366 [2021-12-14 19:53:48,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:53:48,026 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 90 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:48,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 1547 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:48,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-12-14 19:53:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 360. [2021-12-14 19:53:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 319 states have (on average 1.2570532915360502) internal successors, (401), 323 states have internal predecessors, (401), 26 states have call successors, (26), 14 states have call predecessors, (26), 14 states have return successors, (35), 23 states have call predecessors, (35), 22 states have call successors, (35) [2021-12-14 19:53:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 462 transitions. [2021-12-14 19:53:48,031 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 462 transitions. Word has length 56 [2021-12-14 19:53:48,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:48,031 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 462 transitions. [2021-12-14 19:53:48,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:53:48,032 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 462 transitions. [2021-12-14 19:53:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-14 19:53:48,032 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:48,033 INFO L514 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] [2021-12-14 19:53:48,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-12-14 19:53:48,033 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:48,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:48,033 INFO L85 PathProgramCache]: Analyzing trace with hash 835021725, now seen corresponding path program 1 times [2021-12-14 19:53:48,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:48,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360242875] [2021-12-14 19:53:48,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:48,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:48,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 19:53:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:48,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 19:53:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:48,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:48,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:48,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360242875] [2021-12-14 19:53:48,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360242875] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:48,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:48,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:53:48,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113870833] [2021-12-14 19:53:48,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:48,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:53:48,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:48,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:53:48,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:53:48,078 INFO L87 Difference]: Start difference. First operand 360 states and 462 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:53:48,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:48,237 INFO L93 Difference]: Finished difference Result 341 states and 429 transitions. [2021-12-14 19:53:48,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:53:48,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2021-12-14 19:53:48,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:48,238 INFO L225 Difference]: With dead ends: 341 [2021-12-14 19:53:48,239 INFO L226 Difference]: Without dead ends: 341 [2021-12-14 19:53:48,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:53:48,241 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 250 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:48,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 870 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:48,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-12-14 19:53:48,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 327. [2021-12-14 19:53:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 291 states have (on average 1.2577319587628866) internal successors, (366), 294 states have internal predecessors, (366), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2021-12-14 19:53:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 412 transitions. [2021-12-14 19:53:48,246 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 412 transitions. Word has length 62 [2021-12-14 19:53:48,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:48,246 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 412 transitions. [2021-12-14 19:53:48,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:53:48,246 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 412 transitions. [2021-12-14 19:53:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-14 19:53:48,247 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:48,247 INFO L514 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] [2021-12-14 19:53:48,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-12-14 19:53:48,247 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:48,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:48,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1659041663, now seen corresponding path program 1 times [2021-12-14 19:53:48,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:48,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7574494] [2021-12-14 19:53:48,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:48,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:48,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 19:53:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:48,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 19:53:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:48,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:48,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7574494] [2021-12-14 19:53:48,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7574494] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:48,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:48,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:53:48,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10727953] [2021-12-14 19:53:48,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:48,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:53:48,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:48,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:53:48,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:53:48,305 INFO L87 Difference]: Start difference. First operand 327 states and 412 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:53:48,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:48,537 INFO L93 Difference]: Finished difference Result 361 states and 451 transitions. [2021-12-14 19:53:48,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:53:48,538 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 66 [2021-12-14 19:53:48,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:48,539 INFO L225 Difference]: With dead ends: 361 [2021-12-14 19:53:48,539 INFO L226 Difference]: Without dead ends: 345 [2021-12-14 19:53:48,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-12-14 19:53:48,539 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 352 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:48,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 1341 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:48,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-12-14 19:53:48,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 327. [2021-12-14 19:53:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 291 states have (on average 1.254295532646048) internal successors, (365), 294 states have internal predecessors, (365), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2021-12-14 19:53:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 411 transitions. [2021-12-14 19:53:48,546 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 411 transitions. Word has length 66 [2021-12-14 19:53:48,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:48,547 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 411 transitions. [2021-12-14 19:53:48,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:53:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 411 transitions. [2021-12-14 19:53:48,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-14 19:53:48,549 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:48,549 INFO L514 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-12-14 19:53:48,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-12-14 19:53:48,550 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:48,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:48,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1959206108, now seen corresponding path program 1 times [2021-12-14 19:53:48,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:48,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787141151] [2021-12-14 19:53:48,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:48,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:48,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:53:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:48,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 19:53:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:48,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:53:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:48,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:48,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787141151] [2021-12-14 19:53:48,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787141151] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:48,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:48,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:53:48,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399968499] [2021-12-14 19:53:48,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:48,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:53:48,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:48,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:53:48,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:48,601 INFO L87 Difference]: Start difference. First operand 327 states and 411 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:53:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:48,896 INFO L93 Difference]: Finished difference Result 440 states and 536 transitions. [2021-12-14 19:53:48,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:53:48,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2021-12-14 19:53:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:48,898 INFO L225 Difference]: With dead ends: 440 [2021-12-14 19:53:48,898 INFO L226 Difference]: Without dead ends: 440 [2021-12-14 19:53:48,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:53:48,898 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 484 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:48,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [490 Valid, 1220 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:48,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-12-14 19:53:48,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 421. [2021-12-14 19:53:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 375 states have (on average 1.2426666666666666) internal successors, (466), 380 states have internal predecessors, (466), 25 states have call successors, (25), 19 states have call predecessors, (25), 20 states have return successors, (26), 22 states have call predecessors, (26), 22 states have call successors, (26) [2021-12-14 19:53:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 517 transitions. [2021-12-14 19:53:48,909 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 517 transitions. Word has length 68 [2021-12-14 19:53:48,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:48,909 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 517 transitions. [2021-12-14 19:53:48,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:53:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 517 transitions. [2021-12-14 19:53:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 19:53:48,911 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:48,911 INFO L514 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] [2021-12-14 19:53:48,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-12-14 19:53:48,911 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:48,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:48,911 INFO L85 PathProgramCache]: Analyzing trace with hash -2019693577, now seen corresponding path program 1 times [2021-12-14 19:53:48,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:48,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646015317] [2021-12-14 19:53:48,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:48,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:48,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:53:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:48,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 19:53:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:48,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 19:53:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:48,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:48,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646015317] [2021-12-14 19:53:48,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646015317] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:48,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:48,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 19:53:48,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700758537] [2021-12-14 19:53:48,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:48,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:53:48,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:48,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:53:48,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:53:48,983 INFO L87 Difference]: Start difference. First operand 421 states and 517 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-14 19:53:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:49,343 INFO L93 Difference]: Finished difference Result 420 states and 515 transitions. [2021-12-14 19:53:49,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:53:49,348 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 69 [2021-12-14 19:53:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:49,349 INFO L225 Difference]: With dead ends: 420 [2021-12-14 19:53:49,349 INFO L226 Difference]: Without dead ends: 346 [2021-12-14 19:53:49,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-12-14 19:53:49,350 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 193 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:49,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 1429 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:53:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-12-14 19:53:49,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2021-12-14 19:53:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 307 states have (on average 1.247557003257329) internal successors, (383), 311 states have internal predecessors, (383), 21 states have call successors, (21), 16 states have call predecessors, (21), 17 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2021-12-14 19:53:49,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 427 transitions. [2021-12-14 19:53:49,354 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 427 transitions. Word has length 69 [2021-12-14 19:53:49,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:49,354 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 427 transitions. [2021-12-14 19:53:49,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-14 19:53:49,354 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 427 transitions. [2021-12-14 19:53:49,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-14 19:53:49,355 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:49,355 INFO L514 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-12-14 19:53:49,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-12-14 19:53:49,355 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:49,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:49,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2013543144, now seen corresponding path program 1 times [2021-12-14 19:53:49,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:49,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234029509] [2021-12-14 19:53:49,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:49,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:49,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 19:53:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:49,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:53:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:49,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:49,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234029509] [2021-12-14 19:53:49,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234029509] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:49,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:49,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:53:49,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611762208] [2021-12-14 19:53:49,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:49,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:53:49,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:49,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:53:49,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:53:49,407 INFO L87 Difference]: Start difference. First operand 346 states and 427 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:53:49,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:49,522 INFO L93 Difference]: Finished difference Result 398 states and 491 transitions. [2021-12-14 19:53:49,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:53:49,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2021-12-14 19:53:49,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:49,525 INFO L225 Difference]: With dead ends: 398 [2021-12-14 19:53:49,525 INFO L226 Difference]: Without dead ends: 373 [2021-12-14 19:53:49,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:53:49,526 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 106 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:49,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 1112 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-12-14 19:53:49,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 357. [2021-12-14 19:53:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 317 states have (on average 1.22397476340694) internal successors, (388), 322 states have internal predecessors, (388), 22 states have call successors, (22), 16 states have call predecessors, (22), 17 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2021-12-14 19:53:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 433 transitions. [2021-12-14 19:53:49,531 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 433 transitions. Word has length 71 [2021-12-14 19:53:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:49,531 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 433 transitions. [2021-12-14 19:53:49,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:53:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 433 transitions. [2021-12-14 19:53:49,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-14 19:53:49,532 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:49,532 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:53:49,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-12-14 19:53:49,532 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:49,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:49,532 INFO L85 PathProgramCache]: Analyzing trace with hash -291513568, now seen corresponding path program 1 times [2021-12-14 19:53:49,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:49,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142580791] [2021-12-14 19:53:49,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:49,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:49,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 19:53:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:49,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 19:53:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:53:49,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:49,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142580791] [2021-12-14 19:53:49,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142580791] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:49,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:49,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:53:49,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626427734] [2021-12-14 19:53:49,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:49,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:53:49,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:49,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:53:49,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:53:49,593 INFO L87 Difference]: Start difference. First operand 357 states and 433 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:53:49,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:49,676 INFO L93 Difference]: Finished difference Result 392 states and 476 transitions. [2021-12-14 19:53:49,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:53:49,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2021-12-14 19:53:49,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:49,677 INFO L225 Difference]: With dead ends: 392 [2021-12-14 19:53:49,677 INFO L226 Difference]: Without dead ends: 392 [2021-12-14 19:53:49,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:49,680 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 77 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:49,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 1229 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:49,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-12-14 19:53:49,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 265. [2021-12-14 19:53:49,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 234 states have (on average 1.1794871794871795) internal successors, (276), 238 states have internal predecessors, (276), 16 states have call successors, (16), 12 states have call predecessors, (16), 14 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2021-12-14 19:53:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 311 transitions. [2021-12-14 19:53:49,693 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 311 transitions. Word has length 74 [2021-12-14 19:53:49,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:49,693 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 311 transitions. [2021-12-14 19:53:49,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:53:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 311 transitions. [2021-12-14 19:53:49,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-14 19:53:49,694 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:49,694 INFO L514 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] [2021-12-14 19:53:49,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-12-14 19:53:49,695 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:49,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:49,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1369005511, now seen corresponding path program 1 times [2021-12-14 19:53:49,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:49,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817882760] [2021-12-14 19:53:49,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:49,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:49,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 19:53:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:49,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 19:53:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:49,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-14 19:53:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:49,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:49,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817882760] [2021-12-14 19:53:49,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817882760] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:49,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:49,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-14 19:53:49,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234840167] [2021-12-14 19:53:49,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:49,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 19:53:49,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:49,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 19:53:49,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:53:49,765 INFO L87 Difference]: Start difference. First operand 265 states and 311 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:53:50,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:50,031 INFO L93 Difference]: Finished difference Result 494 states and 579 transitions. [2021-12-14 19:53:50,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 19:53:50,032 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 77 [2021-12-14 19:53:50,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:50,033 INFO L225 Difference]: With dead ends: 494 [2021-12-14 19:53:50,033 INFO L226 Difference]: Without dead ends: 444 [2021-12-14 19:53:50,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2021-12-14 19:53:50,034 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 522 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:50,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [522 Valid, 1202 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:50,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-12-14 19:53:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 191. [2021-12-14 19:53:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 173 states have internal predecessors, (198), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-14 19:53:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 217 transitions. [2021-12-14 19:53:50,038 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 217 transitions. Word has length 77 [2021-12-14 19:53:50,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:50,038 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 217 transitions. [2021-12-14 19:53:50,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:53:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2021-12-14 19:53:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-14 19:53:50,039 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:50,039 INFO L514 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-12-14 19:53:50,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-12-14 19:53:50,040 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:50,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:50,040 INFO L85 PathProgramCache]: Analyzing trace with hash 586260984, now seen corresponding path program 1 times [2021-12-14 19:53:50,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:50,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602278941] [2021-12-14 19:53:50,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:50,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 19:53:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:53:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:53:50,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:50,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602278941] [2021-12-14 19:53:50,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602278941] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:50,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:50,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:53:50,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370552902] [2021-12-14 19:53:50,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:50,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:53:50,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:50,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:53:50,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:53:50,083 INFO L87 Difference]: Start difference. First operand 191 states and 217 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:53:50,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:50,139 INFO L93 Difference]: Finished difference Result 199 states and 225 transitions. [2021-12-14 19:53:50,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:53:50,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 83 [2021-12-14 19:53:50,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:50,140 INFO L225 Difference]: With dead ends: 199 [2021-12-14 19:53:50,140 INFO L226 Difference]: Without dead ends: 197 [2021-12-14 19:53:50,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:53:50,140 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 45 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:50,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 513 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:53:50,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-14 19:53:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 191. [2021-12-14 19:53:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 171 states have (on average 1.152046783625731) internal successors, (197), 173 states have internal predecessors, (197), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-14 19:53:50,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2021-12-14 19:53:50,143 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 83 [2021-12-14 19:53:50,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:50,143 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2021-12-14 19:53:50,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:53:50,144 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2021-12-14 19:53:50,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-12-14 19:53:50,144 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:50,145 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:53:50,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-12-14 19:53:50,145 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:50,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:50,145 INFO L85 PathProgramCache]: Analyzing trace with hash 727590310, now seen corresponding path program 1 times [2021-12-14 19:53:50,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:50,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076066036] [2021-12-14 19:53:50,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:50,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 19:53:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 19:53:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 19:53:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 19:53:50,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:50,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076066036] [2021-12-14 19:53:50,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076066036] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:50,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:50,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:53:50,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729978278] [2021-12-14 19:53:50,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:50,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:53:50,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:50,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:53:50,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:53:50,206 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:53:50,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:50,272 INFO L93 Difference]: Finished difference Result 221 states and 250 transitions. [2021-12-14 19:53:50,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:53:50,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 103 [2021-12-14 19:53:50,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:50,273 INFO L225 Difference]: With dead ends: 221 [2021-12-14 19:53:50,273 INFO L226 Difference]: Without dead ends: 221 [2021-12-14 19:53:50,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:53:50,273 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 47 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:50,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 687 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:50,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-14 19:53:50,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 193. [2021-12-14 19:53:50,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 173 states have (on average 1.1502890173410405) internal successors, (199), 175 states have internal predecessors, (199), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-14 19:53:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 218 transitions. [2021-12-14 19:53:50,276 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 218 transitions. Word has length 103 [2021-12-14 19:53:50,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:50,276 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 218 transitions. [2021-12-14 19:53:50,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:53:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 218 transitions. [2021-12-14 19:53:50,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-12-14 19:53:50,277 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:50,277 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:53:50,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-12-14 19:53:50,278 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:50,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1604320614, now seen corresponding path program 1 times [2021-12-14 19:53:50,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:50,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521666477] [2021-12-14 19:53:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:50,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 19:53:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 19:53:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 19:53:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,344 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 19:53:50,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:50,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521666477] [2021-12-14 19:53:50,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521666477] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:50,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:50,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:53:50,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407506369] [2021-12-14 19:53:50,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:50,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:53:50,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:50,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:53:50,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:53:50,346 INFO L87 Difference]: Start difference. First operand 193 states and 218 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:53:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:50,493 INFO L93 Difference]: Finished difference Result 234 states and 266 transitions. [2021-12-14 19:53:50,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:53:50,493 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 103 [2021-12-14 19:53:50,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:50,494 INFO L225 Difference]: With dead ends: 234 [2021-12-14 19:53:50,494 INFO L226 Difference]: Without dead ends: 201 [2021-12-14 19:53:50,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:53:50,494 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 309 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:50,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 880 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:50,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-12-14 19:53:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 191. [2021-12-14 19:53:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 171 states have (on average 1.1403508771929824) internal successors, (195), 173 states have internal predecessors, (195), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-14 19:53:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 214 transitions. [2021-12-14 19:53:50,497 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 214 transitions. Word has length 103 [2021-12-14 19:53:50,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:50,497 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 214 transitions. [2021-12-14 19:53:50,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:53:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 214 transitions. [2021-12-14 19:53:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-12-14 19:53:50,498 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:50,498 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:53:50,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-12-14 19:53:50,498 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:50,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:50,499 INFO L85 PathProgramCache]: Analyzing trace with hash -247821256, now seen corresponding path program 1 times [2021-12-14 19:53:50,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:50,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641987604] [2021-12-14 19:53:50,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:50,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 19:53:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 19:53:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-14 19:53:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 19:53:50,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:50,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641987604] [2021-12-14 19:53:50,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641987604] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:50,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:50,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-14 19:53:50,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060856484] [2021-12-14 19:53:50,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:50,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 19:53:50,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:50,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 19:53:50,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:53:50,598 INFO L87 Difference]: Start difference. First operand 191 states and 214 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 11 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:53:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:50,854 INFO L93 Difference]: Finished difference Result 281 states and 322 transitions. [2021-12-14 19:53:50,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 19:53:50,855 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 11 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 104 [2021-12-14 19:53:50,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:50,856 INFO L225 Difference]: With dead ends: 281 [2021-12-14 19:53:50,856 INFO L226 Difference]: Without dead ends: 250 [2021-12-14 19:53:50,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2021-12-14 19:53:50,856 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 509 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:50,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 1299 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:50,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-12-14 19:53:50,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 198. [2021-12-14 19:53:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 178 states have (on average 1.146067415730337) internal successors, (204), 180 states have internal predecessors, (204), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-14 19:53:50,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2021-12-14 19:53:50,859 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 104 [2021-12-14 19:53:50,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:50,859 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2021-12-14 19:53:50,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 11 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:53:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2021-12-14 19:53:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-14 19:53:50,860 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:50,860 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:53:50,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-12-14 19:53:50,860 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:50,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash -629299870, now seen corresponding path program 1 times [2021-12-14 19:53:50,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:50,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94234354] [2021-12-14 19:53:50,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:50,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 19:53:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 19:53:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 19:53:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 19:53:50,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:50,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94234354] [2021-12-14 19:53:50,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94234354] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:50,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:50,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:53:50,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755244075] [2021-12-14 19:53:50,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:50,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:53:50,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:50,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:53:50,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:53:50,910 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:53:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:50,977 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2021-12-14 19:53:50,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:53:50,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 108 [2021-12-14 19:53:50,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:50,978 INFO L225 Difference]: With dead ends: 199 [2021-12-14 19:53:50,979 INFO L226 Difference]: Without dead ends: 190 [2021-12-14 19:53:50,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:50,979 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 149 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:50,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 384 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-14 19:53:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 184. [2021-12-14 19:53:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 164 states have (on average 1.1219512195121952) internal successors, (184), 166 states have internal predecessors, (184), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-14 19:53:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 203 transitions. [2021-12-14 19:53:50,982 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 203 transitions. Word has length 108 [2021-12-14 19:53:50,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:50,982 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 203 transitions. [2021-12-14 19:53:50,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:53:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 203 transitions. [2021-12-14 19:53:50,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-14 19:53:50,983 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:50,983 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:53:50,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-12-14 19:53:50,983 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:50,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:50,983 INFO L85 PathProgramCache]: Analyzing trace with hash 809951383, now seen corresponding path program 1 times [2021-12-14 19:53:50,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:50,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718019719] [2021-12-14 19:53:50,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:50,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:51,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 19:53:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:51,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 19:53:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:51,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 19:53:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:51,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 19:53:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 19:53:51,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:51,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718019719] [2021-12-14 19:53:51,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718019719] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:51,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:51,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:53:51,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598298362] [2021-12-14 19:53:51,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:51,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:53:51,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:51,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:53:51,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:53:51,056 INFO L87 Difference]: Start difference. First operand 184 states and 203 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:53:51,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:51,144 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2021-12-14 19:53:51,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:53:51,145 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 114 [2021-12-14 19:53:51,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:51,151 INFO L225 Difference]: With dead ends: 173 [2021-12-14 19:53:51,151 INFO L226 Difference]: Without dead ends: 163 [2021-12-14 19:53:51,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:53:51,152 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 46 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:51,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 839 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:51,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-14 19:53:51,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-12-14 19:53:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 146 states have (on average 1.1095890410958904) internal successors, (162), 147 states have internal predecessors, (162), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2021-12-14 19:53:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2021-12-14 19:53:51,154 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 114 [2021-12-14 19:53:51,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:51,154 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2021-12-14 19:53:51,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:53:51,155 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2021-12-14 19:53:51,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-14 19:53:51,155 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:51,155 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:53:51,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-12-14 19:53:51,156 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:51,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1384297966, now seen corresponding path program 1 times [2021-12-14 19:53:51,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:51,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483844952] [2021-12-14 19:53:51,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:51,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:51,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 19:53:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:51,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 19:53:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:51,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 19:53:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:51,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 19:53:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 19:53:51,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:51,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483844952] [2021-12-14 19:53:51,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483844952] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:51,227 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:51,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:53:51,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345076580] [2021-12-14 19:53:51,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:51,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:53:51,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:51,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:53:51,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:53:51,228 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:53:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:51,376 INFO L93 Difference]: Finished difference Result 284 states and 309 transitions. [2021-12-14 19:53:51,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:53:51,382 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 115 [2021-12-14 19:53:51,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:51,383 INFO L225 Difference]: With dead ends: 284 [2021-12-14 19:53:51,383 INFO L226 Difference]: Without dead ends: 163 [2021-12-14 19:53:51,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-12-14 19:53:51,384 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 130 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:51,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 819 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:51,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-14 19:53:51,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-12-14 19:53:51,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 146 states have (on average 1.1027397260273972) internal successors, (161), 147 states have internal predecessors, (161), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2021-12-14 19:53:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2021-12-14 19:53:51,386 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 115 [2021-12-14 19:53:51,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:51,386 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2021-12-14 19:53:51,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:53:51,387 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2021-12-14 19:53:51,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-14 19:53:51,387 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:51,387 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:53:51,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-12-14 19:53:51,388 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-12-14 19:53:51,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:51,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1263306388, now seen corresponding path program 1 times [2021-12-14 19:53:51,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:51,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424914860] [2021-12-14 19:53:51,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:51,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:51,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 19:53:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:51,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 19:53:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:51,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 19:53:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:51,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 19:53:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:51,484 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 19:53:51,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:51,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424914860] [2021-12-14 19:53:51,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424914860] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:51,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:51,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-14 19:53:51,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851300426] [2021-12-14 19:53:51,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:51,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 19:53:51,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:51,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 19:53:51,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:53:51,486 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand has 14 states, 14 states have (on average 6.714285714285714) internal successors, (94), 11 states have internal predecessors, (94), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 19:53:51,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:51,780 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2021-12-14 19:53:51,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 19:53:51,781 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.714285714285714) internal successors, (94), 11 states have internal predecessors, (94), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 115 [2021-12-14 19:53:51,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:51,781 INFO L225 Difference]: With dead ends: 173 [2021-12-14 19:53:51,781 INFO L226 Difference]: Without dead ends: 0 [2021-12-14 19:53:51,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2021-12-14 19:53:51,782 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 410 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:51,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 829 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:53:51,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-14 19:53:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-14 19:53:51,782 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-12-14 19:53:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-14 19:53:51,782 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2021-12-14 19:53:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:51,782 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 19:53:51,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.714285714285714) internal successors, (94), 11 states have internal predecessors, (94), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 19:53:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-14 19:53:51,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-14 19:53:51,784 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2021-12-14 19:53:51,785 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2021-12-14 19:53:51,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-12-14 19:53:51,787 INFO L732 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] [2021-12-14 19:53:51,788 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 19:53:51,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 07:53:51 BoogieIcfgContainer [2021-12-14 19:53:51,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 19:53:51,790 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 19:53:51,790 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 19:53:51,790 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 19:53:51,790 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:53:36" (3/4) ... [2021-12-14 19:53:51,792 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-14 19:53:51,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2021-12-14 19:53:51,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2021-12-14 19:53:51,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2021-12-14 19:53:51,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2021-12-14 19:53:51,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2021-12-14 19:53:51,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2021-12-14 19:53:51,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2021-12-14 19:53:51,818 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 68 nodes and edges [2021-12-14 19:53:51,819 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2021-12-14 19:53:51,820 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-12-14 19:53:51,822 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-14 19:53:51,901 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 19:53:51,901 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 19:53:51,901 INFO L158 Benchmark]: Toolchain (without parser) took 16658.49ms. Allocated memory was 88.1MB in the beginning and 268.4MB in the end (delta: 180.4MB). Free memory was 57.3MB in the beginning and 82.9MB in the end (delta: -25.5MB). Peak memory consumption was 155.8MB. Max. memory is 16.1GB. [2021-12-14 19:53:51,901 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory was 45.5MB in the beginning and 45.5MB in the end (delta: 40.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:53:51,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.80ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 57.3MB in the beginning and 81.3MB in the end (delta: -24.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-14 19:53:51,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.83ms. Allocated memory is still 117.4MB. Free memory was 81.3MB in the beginning and 75.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-14 19:53:51,902 INFO L158 Benchmark]: Boogie Preprocessor took 72.11ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 70.8MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-14 19:53:51,902 INFO L158 Benchmark]: RCFGBuilder took 909.63ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 66.6MB in the end (delta: 4.2MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2021-12-14 19:53:51,902 INFO L158 Benchmark]: TraceAbstraction took 15095.13ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 66.4MB in the beginning and 109.3MB in the end (delta: -43.0MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2021-12-14 19:53:51,902 INFO L158 Benchmark]: Witness Printer took 111.21ms. Allocated memory is still 268.4MB. Free memory was 109.3MB in the beginning and 82.9MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-12-14 19:53:51,903 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.14ms. Allocated memory is still 88.1MB. Free memory was 45.5MB in the beginning and 45.5MB in the end (delta: 40.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.80ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 57.3MB in the beginning and 81.3MB in the end (delta: -24.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.83ms. Allocated memory is still 117.4MB. Free memory was 81.3MB in the beginning and 75.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.11ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 70.8MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 909.63ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 66.6MB in the end (delta: 4.2MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15095.13ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 66.4MB in the beginning and 109.3MB in the end (delta: -43.0MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. * Witness Printer took 111.21ms. Allocated memory is still 268.4MB. Free memory was 109.3MB in the beginning and 82.9MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * 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: 1627]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 667]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 319 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 61, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14204 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13916 mSDsluCounter, 77333 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56297 mSDsCounter, 2362 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18097 IncrementalHoareTripleChecker+Invalid, 20459 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2362 mSolverCounterUnsat, 21036 mSDtfsCounter, 18097 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 740 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 469 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=707occurred in iteration=21, InterpolantAutomatonStates: 461, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 61 MinimizatonAttempts, 1573 StatesRemovedByMinimization, 55 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 3098 NumberOfCodeBlocks, 3098 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 3037 ConstructedInterpolants, 0 QuantifiedInterpolants, 6827 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 61 InterpolantComputations, 61 PerfectInterpolantSequences, 125/125 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-12-14 19:53:51,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE