./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 13:08:59,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 13:08:59,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 13:08:59,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 13:08:59,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 13:08:59,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 13:08:59,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 13:08:59,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 13:08:59,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 13:08:59,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 13:08:59,660 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 13:08:59,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 13:08:59,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 13:08:59,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 13:08:59,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 13:08:59,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 13:08:59,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 13:08:59,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 13:08:59,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 13:08:59,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 13:08:59,674 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 13:08:59,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 13:08:59,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 13:08:59,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 13:08:59,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 13:08:59,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 13:08:59,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 13:08:59,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 13:08:59,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 13:08:59,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 13:08:59,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 13:08:59,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 13:08:59,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 13:08:59,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 13:08:59,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 13:08:59,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 13:08:59,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 13:08:59,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 13:08:59,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 13:08:59,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 13:08:59,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 13:08:59,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 13:08:59,691 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 13:08:59,715 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 13:08:59,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 13:08:59,716 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 13:08:59,716 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 13:08:59,717 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 13:08:59,717 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 13:08:59,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 13:08:59,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 13:08:59,718 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 13:08:59,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 13:08:59,718 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 13:08:59,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 13:08:59,719 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 13:08:59,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 13:08:59,719 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 13:08:59,719 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 13:08:59,719 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 13:08:59,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 13:08:59,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 13:08:59,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 13:08:59,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 13:08:59,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 13:08:59,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 13:08:59,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 13:08:59,720 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 13:08:59,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 13:08:59,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 13:08:59,721 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 13:08:59,721 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 13:08:59,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 13:08:59,721 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 ! call(reach_error())) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b [2022-07-12 13:08:59,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 13:08:59,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 13:08:59,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 13:08:59,936 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 13:08:59,936 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 13:08:59,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-12 13:08:59,984 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b482c6f/9bbff79c46b546efbe021f255106bab6/FLAG0a944e5a7 [2022-07-12 13:09:00,478 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 13:09:00,479 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-12 13:09:00,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b482c6f/9bbff79c46b546efbe021f255106bab6/FLAG0a944e5a7 [2022-07-12 13:09:01,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b482c6f/9bbff79c46b546efbe021f255106bab6 [2022-07-12 13:09:01,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 13:09:01,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 13:09:01,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 13:09:01,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 13:09:01,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 13:09:01,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:09:01" (1/1) ... [2022-07-12 13:09:01,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56bf6737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:09:01, skipping insertion in model container [2022-07-12 13:09:01,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:09:01" (1/1) ... [2022-07-12 13:09:01,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 13:09:01,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 13:09:01,469 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/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-07-12 13:09:01,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:09:01,527 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 13:09:01,634 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/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-07-12 13:09:01,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:09:01,673 INFO L208 MainTranslator]: Completed translation [2022-07-12 13:09:01,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:09:01 WrapperNode [2022-07-12 13:09:01,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 13:09:01,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 13:09:01,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 13:09:01,677 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 13:09:01,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:09:01" (1/1) ... [2022-07-12 13:09:01,713 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:09:01" (1/1) ... [2022-07-12 13:09:01,763 INFO L137 Inliner]: procedures = 107, calls = 312, calls flagged for inlining = 47, calls inlined = 41, statements flattened = 771 [2022-07-12 13:09:01,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 13:09:01,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 13:09:01,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 13:09:01,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 13:09:01,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:09:01" (1/1) ... [2022-07-12 13:09:01,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:09:01" (1/1) ... [2022-07-12 13:09:01,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:09:01" (1/1) ... [2022-07-12 13:09:01,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:09:01" (1/1) ... [2022-07-12 13:09:01,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:09:01" (1/1) ... [2022-07-12 13:09:01,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:09:01" (1/1) ... [2022-07-12 13:09:01,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:09:01" (1/1) ... [2022-07-12 13:09:01,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 13:09:01,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 13:09:01,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 13:09:01,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 13:09:01,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:09:01" (1/1) ... [2022-07-12 13:09:01,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 13:09:01,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:09:01,892 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) [2022-07-12 13:09:01,911 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 [2022-07-12 13:09:01,931 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 13:09:01,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 13:09:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 13:09:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 13:09:01,932 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 13:09:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 13:09:01,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 13:09:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 13:09:01,932 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 13:09:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-07-12 13:09:01,932 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-07-12 13:09:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 13:09:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 13:09:01,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 13:09:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 13:09:01,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 13:09:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-07-12 13:09:01,933 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-07-12 13:09:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-12 13:09:01,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-12 13:09:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 13:09:01,933 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 13:09:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 13:09:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 13:09:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 13:09:01,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 13:09:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 13:09:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-12 13:09:01,934 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-12 13:09:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-12 13:09:01,934 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-12 13:09:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-07-12 13:09:01,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-07-12 13:09:01,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 13:09:01,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 13:09:01,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 13:09:01,935 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-12 13:09:01,935 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-12 13:09:01,935 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 13:09:01,935 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 13:09:01,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 13:09:01,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 13:09:01,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 13:09:02,136 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 13:09:02,137 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 13:09:02,214 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 13:09:02,636 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 13:09:02,646 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 13:09:02,647 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 13:09:02,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:09:02 BoogieIcfgContainer [2022-07-12 13:09:02,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 13:09:02,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 13:09:02,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 13:09:02,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 13:09:02,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 01:09:01" (1/3) ... [2022-07-12 13:09:02,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:09:02, skipping insertion in model container [2022-07-12 13:09:02,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:09:01" (2/3) ... [2022-07-12 13:09:02,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:09:02, skipping insertion in model container [2022-07-12 13:09:02,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:09:02" (3/3) ... [2022-07-12 13:09:02,655 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-12 13:09:02,664 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 13:09:02,665 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 13:09:02,702 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 13:09:02,708 INFO L357 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@246d9f53, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@27bdfac9 [2022-07-12 13:09:02,708 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 13:09:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 187 states have internal predecessors, (232), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-07-12 13:09:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 13:09:02,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:02,718 INFO L195 NwaCegarLoop]: 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] [2022-07-12 13:09:02,719 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:02,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:02,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1083564762, now seen corresponding path program 1 times [2022-07-12 13:09:02,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:02,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570847236] [2022-07-12 13:09:02,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:02,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 13:09:02,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:02,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570847236] [2022-07-12 13:09:02,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570847236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:02,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:09:02,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 13:09:02,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044638279] [2022-07-12 13:09:02,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:02,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 13:09:02,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:03,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 13:09:03,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 13:09:03,014 INFO L87 Difference]: Start difference. First operand has 235 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 187 states have internal predecessors, (232), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 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) [2022-07-12 13:09:03,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:03,253 INFO L93 Difference]: Finished difference Result 472 states and 644 transitions. [2022-07-12 13:09:03,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 13:09:03,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 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 32 [2022-07-12 13:09:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:03,272 INFO L225 Difference]: With dead ends: 472 [2022-07-12 13:09:03,272 INFO L226 Difference]: Without dead ends: 231 [2022-07-12 13:09:03,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 13:09:03,284 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 84 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 13:09:03,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 464 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 13:09:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-12 13:09:03,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2022-07-12 13:09:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 170 states have (on average 1.2823529411764707) internal successors, (218), 176 states have internal predecessors, (218), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-07-12 13:09:03,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 291 transitions. [2022-07-12 13:09:03,348 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 291 transitions. Word has length 32 [2022-07-12 13:09:03,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:03,348 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 291 transitions. [2022-07-12 13:09:03,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 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) [2022-07-12 13:09:03,349 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 291 transitions. [2022-07-12 13:09:03,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 13:09:03,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:03,352 INFO L195 NwaCegarLoop]: 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] [2022-07-12 13:09:03,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 13:09:03,355 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:03,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:03,358 INFO L85 PathProgramCache]: Analyzing trace with hash -660862936, now seen corresponding path program 1 times [2022-07-12 13:09:03,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:03,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201891927] [2022-07-12 13:09:03,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:03,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 13:09:03,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:03,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201891927] [2022-07-12 13:09:03,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201891927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:03,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:09:03,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:09:03,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900756538] [2022-07-12 13:09:03,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:03,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:09:03,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:03,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:09:03,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:09:03,502 INFO L87 Difference]: Start difference. First operand 224 states and 291 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 13:09:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:03,952 INFO L93 Difference]: Finished difference Result 650 states and 851 transitions. [2022-07-12 13:09:03,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 13:09:03,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-07-12 13:09:03,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:03,959 INFO L225 Difference]: With dead ends: 650 [2022-07-12 13:09:03,959 INFO L226 Difference]: Without dead ends: 431 [2022-07-12 13:09:03,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:09:03,960 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 306 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 13:09:03,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 831 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 13:09:03,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-07-12 13:09:03,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 417. [2022-07-12 13:09:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 317 states have (on average 1.274447949526814) internal successors, (404), 325 states have internal predecessors, (404), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-07-12 13:09:04,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 541 transitions. [2022-07-12 13:09:04,002 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 541 transitions. Word has length 32 [2022-07-12 13:09:04,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:04,003 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 541 transitions. [2022-07-12 13:09:04,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 13:09:04,004 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 541 transitions. [2022-07-12 13:09:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 13:09:04,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:04,008 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 13:09:04,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 13:09:04,008 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:04,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:04,009 INFO L85 PathProgramCache]: Analyzing trace with hash 748866141, now seen corresponding path program 1 times [2022-07-12 13:09:04,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:04,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593117028] [2022-07-12 13:09:04,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:04,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 13:09:04,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:04,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593117028] [2022-07-12 13:09:04,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593117028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:04,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:09:04,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:09:04,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956822053] [2022-07-12 13:09:04,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:04,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:09:04,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:04,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:09:04,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:09:04,153 INFO L87 Difference]: Start difference. First operand 417 states and 541 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 13:09:04,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:04,636 INFO L93 Difference]: Finished difference Result 990 states and 1323 transitions. [2022-07-12 13:09:04,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 13:09:04,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-07-12 13:09:04,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:04,641 INFO L225 Difference]: With dead ends: 990 [2022-07-12 13:09:04,642 INFO L226 Difference]: Without dead ends: 588 [2022-07-12 13:09:04,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:09:04,648 INFO L413 NwaCegarLoop]: 455 mSDtfsCounter, 622 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 13:09:04,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1539 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 13:09:04,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-07-12 13:09:04,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 420. [2022-07-12 13:09:04,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 320 states have (on average 1.26875) internal successors, (406), 328 states have internal predecessors, (406), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-07-12 13:09:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 543 transitions. [2022-07-12 13:09:04,700 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 543 transitions. Word has length 55 [2022-07-12 13:09:04,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:04,702 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 543 transitions. [2022-07-12 13:09:04,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 13:09:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 543 transitions. [2022-07-12 13:09:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 13:09:04,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:04,707 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 13:09:04,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 13:09:04,707 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:04,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:04,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1486182813, now seen corresponding path program 1 times [2022-07-12 13:09:04,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:04,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801380752] [2022-07-12 13:09:04,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 13:09:04,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:04,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801380752] [2022-07-12 13:09:04,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801380752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:04,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:09:04,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:09:04,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451202009] [2022-07-12 13:09:04,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:04,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:09:04,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:04,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:09:04,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:09:04,831 INFO L87 Difference]: Start difference. First operand 420 states and 543 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 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) [2022-07-12 13:09:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:05,182 INFO L93 Difference]: Finished difference Result 1257 states and 1644 transitions. [2022-07-12 13:09:05,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 13:09:05,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 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 55 [2022-07-12 13:09:05,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:05,188 INFO L225 Difference]: With dead ends: 1257 [2022-07-12 13:09:05,188 INFO L226 Difference]: Without dead ends: 852 [2022-07-12 13:09:05,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:09:05,191 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 389 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 13:09:05,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 665 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 13:09:05,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2022-07-12 13:09:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 814. [2022-07-12 13:09:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 625 states have (on average 1.2656) internal successors, (791), 637 states have internal predecessors, (791), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-12 13:09:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1056 transitions. [2022-07-12 13:09:05,237 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1056 transitions. Word has length 55 [2022-07-12 13:09:05,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:05,238 INFO L495 AbstractCegarLoop]: Abstraction has 814 states and 1056 transitions. [2022-07-12 13:09:05,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 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) [2022-07-12 13:09:05,238 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1056 transitions. [2022-07-12 13:09:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 13:09:05,239 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:05,239 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 13:09:05,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 13:09:05,240 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:05,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:05,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1172967990, now seen corresponding path program 1 times [2022-07-12 13:09:05,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:05,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100531929] [2022-07-12 13:09:05,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:05,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 13:09:05,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:05,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100531929] [2022-07-12 13:09:05,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100531929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:05,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:09:05,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:09:05,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110255835] [2022-07-12 13:09:05,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:05,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:09:05,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:05,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:09:05,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:09:05,328 INFO L87 Difference]: Start difference. First operand 814 states and 1056 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 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) [2022-07-12 13:09:05,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:05,505 INFO L93 Difference]: Finished difference Result 844 states and 1101 transitions. [2022-07-12 13:09:05,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 13:09:05,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 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 56 [2022-07-12 13:09:05,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:05,508 INFO L225 Difference]: With dead ends: 844 [2022-07-12 13:09:05,508 INFO L226 Difference]: Without dead ends: 841 [2022-07-12 13:09:05,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:09:05,509 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 310 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:09:05,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 437 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 13:09:05,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-07-12 13:09:05,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 813. [2022-07-12 13:09:05,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 625 states have (on average 1.264) internal successors, (790), 636 states have internal predecessors, (790), 133 states have call successors, (133), 55 states have call predecessors, (133), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-12 13:09:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1054 transitions. [2022-07-12 13:09:05,542 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1054 transitions. Word has length 56 [2022-07-12 13:09:05,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:05,542 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1054 transitions. [2022-07-12 13:09:05,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 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) [2022-07-12 13:09:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1054 transitions. [2022-07-12 13:09:05,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 13:09:05,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:05,543 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 13:09:05,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 13:09:05,544 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:05,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:05,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2002259392, now seen corresponding path program 1 times [2022-07-12 13:09:05,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:05,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637359369] [2022-07-12 13:09:05,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:05,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 13:09:05,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:05,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637359369] [2022-07-12 13:09:05,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637359369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:05,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:09:05,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:09:05,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645904155] [2022-07-12 13:09:05,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:05,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:09:05,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:05,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:09:05,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:09:05,620 INFO L87 Difference]: Start difference. First operand 813 states and 1054 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 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) [2022-07-12 13:09:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:05,822 INFO L93 Difference]: Finished difference Result 843 states and 1099 transitions. [2022-07-12 13:09:05,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 13:09:05,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 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 57 [2022-07-12 13:09:05,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:05,826 INFO L225 Difference]: With dead ends: 843 [2022-07-12 13:09:05,826 INFO L226 Difference]: Without dead ends: 840 [2022-07-12 13:09:05,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:09:05,827 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 270 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 13:09:05,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 591 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 13:09:05,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-07-12 13:09:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 812. [2022-07-12 13:09:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 625 states have (on average 1.2624) internal successors, (789), 635 states have internal predecessors, (789), 132 states have call successors, (132), 55 states have call predecessors, (132), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-12 13:09:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1052 transitions. [2022-07-12 13:09:05,851 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1052 transitions. Word has length 57 [2022-07-12 13:09:05,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:05,851 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 1052 transitions. [2022-07-12 13:09:05,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 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) [2022-07-12 13:09:05,851 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1052 transitions. [2022-07-12 13:09:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 13:09:05,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:05,852 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 13:09:05,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 13:09:05,853 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:05,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:05,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1940484211, now seen corresponding path program 1 times [2022-07-12 13:09:05,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:05,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668440244] [2022-07-12 13:09:05,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:05,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 13:09:05,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:05,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668440244] [2022-07-12 13:09:05,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668440244] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:05,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:09:05,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:09:05,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100896159] [2022-07-12 13:09:05,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:05,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:09:05,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:05,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:09:05,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:09:05,933 INFO L87 Difference]: Start difference. First operand 812 states and 1052 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 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) [2022-07-12 13:09:06,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:06,138 INFO L93 Difference]: Finished difference Result 842 states and 1097 transitions. [2022-07-12 13:09:06,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 13:09:06,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 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 58 [2022-07-12 13:09:06,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:06,141 INFO L225 Difference]: With dead ends: 842 [2022-07-12 13:09:06,141 INFO L226 Difference]: Without dead ends: 839 [2022-07-12 13:09:06,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:09:06,142 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 304 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 13:09:06,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 431 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 13:09:06,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-07-12 13:09:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 811. [2022-07-12 13:09:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 625 states have (on average 1.2608) internal successors, (788), 634 states have internal predecessors, (788), 131 states have call successors, (131), 55 states have call predecessors, (131), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-12 13:09:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1050 transitions. [2022-07-12 13:09:06,166 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1050 transitions. Word has length 58 [2022-07-12 13:09:06,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:06,167 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 1050 transitions. [2022-07-12 13:09:06,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 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) [2022-07-12 13:09:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1050 transitions. [2022-07-12 13:09:06,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 13:09:06,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:06,168 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 13:09:06,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 13:09:06,168 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:06,169 INFO L85 PathProgramCache]: Analyzing trace with hash -25448733, now seen corresponding path program 1 times [2022-07-12 13:09:06,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:06,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144525678] [2022-07-12 13:09:06,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:06,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 13:09:06,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:06,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144525678] [2022-07-12 13:09:06,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144525678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:06,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:09:06,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:09:06,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975319249] [2022-07-12 13:09:06,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:06,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:09:06,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:06,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:09:06,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:09:06,235 INFO L87 Difference]: Start difference. First operand 811 states and 1050 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 3 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) [2022-07-12 13:09:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:06,404 INFO L93 Difference]: Finished difference Result 841 states and 1095 transitions. [2022-07-12 13:09:06,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 13:09:06,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 3 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 59 [2022-07-12 13:09:06,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:06,408 INFO L225 Difference]: With dead ends: 841 [2022-07-12 13:09:06,408 INFO L226 Difference]: Without dead ends: 829 [2022-07-12 13:09:06,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:09:06,409 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 301 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:09:06,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 430 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 13:09:06,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2022-07-12 13:09:06,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 801. [2022-07-12 13:09:06,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 616 states have (on average 1.2597402597402598) internal successors, (776), 624 states have internal predecessors, (776), 130 states have call successors, (130), 55 states have call predecessors, (130), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-12 13:09:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1037 transitions. [2022-07-12 13:09:06,434 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1037 transitions. Word has length 59 [2022-07-12 13:09:06,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:06,434 INFO L495 AbstractCegarLoop]: Abstraction has 801 states and 1037 transitions. [2022-07-12 13:09:06,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 3 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) [2022-07-12 13:09:06,434 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1037 transitions. [2022-07-12 13:09:06,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-12 13:09:06,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:06,436 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:09:06,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 13:09:06,437 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:06,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1150661192, now seen corresponding path program 1 times [2022-07-12 13:09:06,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:06,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705499333] [2022-07-12 13:09:06,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:06,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 13:09:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 13:09:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 13:09:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:09:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 13:09:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 13:09:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 13:09:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 13:09:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 13:09:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 13:09:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 13:09:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-12 13:09:06,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:06,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705499333] [2022-07-12 13:09:06,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705499333] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:06,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:09:06,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:09:06,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881436304] [2022-07-12 13:09:06,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:06,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:09:06,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:06,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:09:06,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:09:06,591 INFO L87 Difference]: Start difference. First operand 801 states and 1037 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 13:09:06,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:06,825 INFO L93 Difference]: Finished difference Result 1679 states and 2189 transitions. [2022-07-12 13:09:06,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 13:09:06,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 160 [2022-07-12 13:09:06,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:06,829 INFO L225 Difference]: With dead ends: 1679 [2022-07-12 13:09:06,829 INFO L226 Difference]: Without dead ends: 893 [2022-07-12 13:09:06,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 13:09:06,832 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 212 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 13:09:06,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 777 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 13:09:06,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2022-07-12 13:09:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 855. [2022-07-12 13:09:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 669 states have (on average 1.2705530642750373) internal successors, (850), 677 states have internal predecessors, (850), 130 states have call successors, (130), 56 states have call predecessors, (130), 55 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-12 13:09:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1111 transitions. [2022-07-12 13:09:06,859 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1111 transitions. Word has length 160 [2022-07-12 13:09:06,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:06,859 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 1111 transitions. [2022-07-12 13:09:06,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 13:09:06,860 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1111 transitions. [2022-07-12 13:09:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-12 13:09:06,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:06,862 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:09:06,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 13:09:06,862 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:06,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:06,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1334474301, now seen corresponding path program 1 times [2022-07-12 13:09:06,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:06,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168756405] [2022-07-12 13:09:06,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:06,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:09:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 13:09:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 13:09:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 13:09:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 13:09:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:09:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 13:09:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:09:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 13:09:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 13:09:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 13:09:07,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:07,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168756405] [2022-07-12 13:09:07,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168756405] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:07,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:09:07,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 13:09:07,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375672082] [2022-07-12 13:09:07,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:07,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 13:09:07,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:07,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 13:09:07,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:09:07,029 INFO L87 Difference]: Start difference. First operand 855 states and 1111 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 13:09:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:07,337 INFO L93 Difference]: Finished difference Result 2293 states and 3074 transitions. [2022-07-12 13:09:07,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 13:09:07,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 169 [2022-07-12 13:09:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:07,342 INFO L225 Difference]: With dead ends: 2293 [2022-07-12 13:09:07,343 INFO L226 Difference]: Without dead ends: 1457 [2022-07-12 13:09:07,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:09:07,345 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 455 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 13:09:07,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1533 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 13:09:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2022-07-12 13:09:07,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 867. [2022-07-12 13:09:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 681 states have (on average 1.2657856093979443) internal successors, (862), 689 states have internal predecessors, (862), 130 states have call successors, (130), 56 states have call predecessors, (130), 55 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-12 13:09:07,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1123 transitions. [2022-07-12 13:09:07,378 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1123 transitions. Word has length 169 [2022-07-12 13:09:07,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:07,378 INFO L495 AbstractCegarLoop]: Abstraction has 867 states and 1123 transitions. [2022-07-12 13:09:07,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 13:09:07,379 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1123 transitions. [2022-07-12 13:09:07,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-12 13:09:07,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:07,381 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:09:07,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 13:09:07,381 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:07,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:07,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1080620452, now seen corresponding path program 1 times [2022-07-12 13:09:07,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:07,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998220074] [2022-07-12 13:09:07,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:07,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:09:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 13:09:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 13:09:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 13:09:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 13:09:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 13:09:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 13:09:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 13:09:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:09:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 13:09:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 13:09:07,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:07,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998220074] [2022-07-12 13:09:07,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998220074] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:09:07,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72430421] [2022-07-12 13:09:07,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:07,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:09:07,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:09:07,585 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:09:07,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 13:09:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:07,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 13:09:07,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:09:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 13:09:07,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:09:07,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72430421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:07,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:09:07,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-12 13:09:07,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920039823] [2022-07-12 13:09:07,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:07,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:09:07,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:07,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:09:07,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:09:07,961 INFO L87 Difference]: Start difference. First operand 867 states and 1123 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 13:09:08,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:08,113 INFO L93 Difference]: Finished difference Result 2809 states and 3672 transitions. [2022-07-12 13:09:08,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 13:09:08,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 171 [2022-07-12 13:09:08,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:08,120 INFO L225 Difference]: With dead ends: 2809 [2022-07-12 13:09:08,120 INFO L226 Difference]: Without dead ends: 1961 [2022-07-12 13:09:08,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-07-12 13:09:08,124 INFO L413 NwaCegarLoop]: 580 mSDtfsCounter, 394 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:09:08,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1866 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 13:09:08,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2022-07-12 13:09:08,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 903. [2022-07-12 13:09:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 709 states have (on average 1.2552891396332864) internal successors, (890), 717 states have internal predecessors, (890), 138 states have call successors, (138), 56 states have call predecessors, (138), 55 states have return successors, (139), 137 states have call predecessors, (139), 137 states have call successors, (139) [2022-07-12 13:09:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1167 transitions. [2022-07-12 13:09:08,186 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1167 transitions. Word has length 171 [2022-07-12 13:09:08,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:08,186 INFO L495 AbstractCegarLoop]: Abstraction has 903 states and 1167 transitions. [2022-07-12 13:09:08,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 13:09:08,187 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1167 transitions. [2022-07-12 13:09:08,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-12 13:09:08,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:08,189 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:09:08,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 13:09:08,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 13:09:08,400 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:08,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:08,400 INFO L85 PathProgramCache]: Analyzing trace with hash -2091737702, now seen corresponding path program 1 times [2022-07-12 13:09:08,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:08,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051157512] [2022-07-12 13:09:08,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:08,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:09:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 13:09:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 13:09:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 13:09:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 13:09:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 13:09:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 13:09:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 13:09:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:09:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 13:09:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,572 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-12 13:09:08,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:08,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051157512] [2022-07-12 13:09:08,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051157512] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:09:08,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130810484] [2022-07-12 13:09:08,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:08,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:09:08,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:09:08,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:09:08,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 13:09:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:08,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 13:09:08,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:09:08,862 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-12 13:09:08,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:09:08,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130810484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:08,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:09:08,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-07-12 13:09:08,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301602492] [2022-07-12 13:09:08,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:08,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:09:08,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:08,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:09:08,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:09:08,864 INFO L87 Difference]: Start difference. First operand 903 states and 1167 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 13:09:08,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:08,935 INFO L93 Difference]: Finished difference Result 1803 states and 2343 transitions. [2022-07-12 13:09:08,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 13:09:08,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 171 [2022-07-12 13:09:08,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:08,939 INFO L225 Difference]: With dead ends: 1803 [2022-07-12 13:09:08,939 INFO L226 Difference]: Without dead ends: 911 [2022-07-12 13:09:08,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:09:08,941 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 0 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 13:09:08,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1102 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 13:09:08,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2022-07-12 13:09:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 911. [2022-07-12 13:09:08,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 713 states have (on average 1.2538569424964936) internal successors, (894), 725 states have internal predecessors, (894), 138 states have call successors, (138), 56 states have call predecessors, (138), 59 states have return successors, (151), 137 states have call predecessors, (151), 137 states have call successors, (151) [2022-07-12 13:09:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1183 transitions. [2022-07-12 13:09:08,984 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1183 transitions. Word has length 171 [2022-07-12 13:09:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:08,985 INFO L495 AbstractCegarLoop]: Abstraction has 911 states and 1183 transitions. [2022-07-12 13:09:08,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 13:09:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1183 transitions. [2022-07-12 13:09:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-12 13:09:08,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:08,988 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:09:09,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 13:09:09,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 13:09:09,207 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:09,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:09,207 INFO L85 PathProgramCache]: Analyzing trace with hash -2083587314, now seen corresponding path program 1 times [2022-07-12 13:09:09,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:09,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693565783] [2022-07-12 13:09:09,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:09,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:09:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 13:09:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 13:09:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 13:09:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:09:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 13:09:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 13:09:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 13:09:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 13:09:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 13:09:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 13:09:09,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:09,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693565783] [2022-07-12 13:09:09,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693565783] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:09:09,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964688227] [2022-07-12 13:09:09,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:09,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:09:09,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:09:09,456 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:09:09,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 13:09:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:09,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-12 13:09:09,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:09:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 33 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-12 13:09:09,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:09:10,080 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 13:09:10,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964688227] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 13:09:10,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 13:09:10,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 20 [2022-07-12 13:09:10,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570040869] [2022-07-12 13:09:10,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 13:09:10,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 13:09:10,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:10,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 13:09:10,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-07-12 13:09:10,082 INFO L87 Difference]: Start difference. First operand 911 states and 1183 transitions. Second operand has 20 states, 20 states have (on average 6.85) internal successors, (137), 12 states have internal predecessors, (137), 4 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) [2022-07-12 13:09:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:10,888 INFO L93 Difference]: Finished difference Result 2037 states and 2676 transitions. [2022-07-12 13:09:10,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 13:09:10,888 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.85) internal successors, (137), 12 states have internal predecessors, (137), 4 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) Word has length 177 [2022-07-12 13:09:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:10,892 INFO L225 Difference]: With dead ends: 2037 [2022-07-12 13:09:10,892 INFO L226 Difference]: Without dead ends: 1145 [2022-07-12 13:09:10,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-07-12 13:09:10,895 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 141 mSDsluCounter, 3245 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 13:09:10,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 3569 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 13:09:10,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2022-07-12 13:09:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 951. [2022-07-12 13:09:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 745 states have (on average 1.2429530201342283) internal successors, (926), 753 states have internal predecessors, (926), 142 states have call successors, (142), 56 states have call predecessors, (142), 63 states have return successors, (167), 149 states have call predecessors, (167), 141 states have call successors, (167) [2022-07-12 13:09:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1235 transitions. [2022-07-12 13:09:10,957 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1235 transitions. Word has length 177 [2022-07-12 13:09:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:10,958 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1235 transitions. [2022-07-12 13:09:10,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.85) internal successors, (137), 12 states have internal predecessors, (137), 4 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) [2022-07-12 13:09:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1235 transitions. [2022-07-12 13:09:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-12 13:09:10,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:10,960 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:09:10,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 13:09:11,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:09:11,179 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:11,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:11,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1620349506, now seen corresponding path program 2 times [2022-07-12 13:09:11,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:11,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321470421] [2022-07-12 13:09:11,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:11,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:09:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 13:09:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 13:09:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 13:09:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 13:09:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:09:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 13:09:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:09:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 13:09:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 13:09:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-12 13:09:11,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:11,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321470421] [2022-07-12 13:09:11,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321470421] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:09:11,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048057336] [2022-07-12 13:09:11,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 13:09:11,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:09:11,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:09:11,411 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:09:11,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 13:09:11,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 13:09:11,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 13:09:11,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 13:09:11,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:09:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-12 13:09:11,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:09:11,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048057336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:11,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:09:11,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2022-07-12 13:09:11,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116510103] [2022-07-12 13:09:11,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:11,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:09:11,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:11,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:09:11,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-07-12 13:09:11,748 INFO L87 Difference]: Start difference. First operand 951 states and 1235 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 13:09:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:12,021 INFO L93 Difference]: Finished difference Result 2075 states and 2732 transitions. [2022-07-12 13:09:12,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 13:09:12,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 183 [2022-07-12 13:09:12,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:12,025 INFO L225 Difference]: With dead ends: 2075 [2022-07-12 13:09:12,025 INFO L226 Difference]: Without dead ends: 1143 [2022-07-12 13:09:12,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-07-12 13:09:12,027 INFO L413 NwaCegarLoop]: 520 mSDtfsCounter, 725 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:09:12,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 2141 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 13:09:12,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2022-07-12 13:09:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 945. [2022-07-12 13:09:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 741 states have (on average 1.2415654520917678) internal successors, (920), 749 states have internal predecessors, (920), 140 states have call successors, (140), 56 states have call predecessors, (140), 63 states have return successors, (165), 147 states have call predecessors, (165), 139 states have call successors, (165) [2022-07-12 13:09:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1225 transitions. [2022-07-12 13:09:12,100 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1225 transitions. Word has length 183 [2022-07-12 13:09:12,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:12,101 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1225 transitions. [2022-07-12 13:09:12,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 13:09:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1225 transitions. [2022-07-12 13:09:12,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-12 13:09:12,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:12,103 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:09:12,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 13:09:12,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:09:12,320 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:12,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:12,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1006053722, now seen corresponding path program 1 times [2022-07-12 13:09:12,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:12,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434165838] [2022-07-12 13:09:12,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:12,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:09:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 13:09:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 13:09:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 13:09:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 13:09:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:09:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 13:09:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:09:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 13:09:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 13:09:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-12 13:09:12,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:12,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434165838] [2022-07-12 13:09:12,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434165838] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:09:12,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506383047] [2022-07-12 13:09:12,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:12,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:09:12,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:09:12,535 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:09:12,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 13:09:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:12,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 1781 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 13:09:12,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:09:13,054 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 13:09:13,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:09:13,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506383047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:13,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:09:13,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-12 13:09:13,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713745405] [2022-07-12 13:09:13,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:13,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 13:09:13,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:13,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 13:09:13,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:09:13,056 INFO L87 Difference]: Start difference. First operand 945 states and 1225 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 13:09:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:13,282 INFO L93 Difference]: Finished difference Result 2799 states and 3638 transitions. [2022-07-12 13:09:13,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 13:09:13,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 202 [2022-07-12 13:09:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:13,292 INFO L225 Difference]: With dead ends: 2799 [2022-07-12 13:09:13,292 INFO L226 Difference]: Without dead ends: 2791 [2022-07-12 13:09:13,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:09:13,294 INFO L413 NwaCegarLoop]: 572 mSDtfsCounter, 400 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:09:13,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1042 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 13:09:13,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2022-07-12 13:09:13,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2777. [2022-07-12 13:09:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2777 states, 2181 states have (on average 1.245300320953691) internal successors, (2716), 2209 states have internal predecessors, (2716), 412 states have call successors, (412), 160 states have call predecessors, (412), 183 states have return successors, (489), 431 states have call predecessors, (489), 411 states have call successors, (489) [2022-07-12 13:09:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 3617 transitions. [2022-07-12 13:09:13,481 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 3617 transitions. Word has length 202 [2022-07-12 13:09:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:13,481 INFO L495 AbstractCegarLoop]: Abstraction has 2777 states and 3617 transitions. [2022-07-12 13:09:13,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 13:09:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3617 transitions. [2022-07-12 13:09:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-12 13:09:13,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:13,485 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:09:13,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 13:09:13,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 13:09:13,705 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:13,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:13,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2017170972, now seen corresponding path program 1 times [2022-07-12 13:09:13,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:13,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222676548] [2022-07-12 13:09:13,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:13,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:09:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 13:09:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 13:09:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 13:09:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 13:09:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:09:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 13:09:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:09:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 13:09:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 13:09:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-12 13:09:13,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:13,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222676548] [2022-07-12 13:09:13,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222676548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:13,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:09:13,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 13:09:13,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529017305] [2022-07-12 13:09:13,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:13,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 13:09:13,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:13,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 13:09:13,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:09:13,859 INFO L87 Difference]: Start difference. First operand 2777 states and 3617 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 13:09:14,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:14,703 INFO L93 Difference]: Finished difference Result 8799 states and 11542 transitions. [2022-07-12 13:09:14,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 13:09:14,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 202 [2022-07-12 13:09:14,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:14,722 INFO L225 Difference]: With dead ends: 8799 [2022-07-12 13:09:14,722 INFO L226 Difference]: Without dead ends: 6041 [2022-07-12 13:09:14,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-12 13:09:14,728 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 460 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 13:09:14,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 1530 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 13:09:14,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2022-07-12 13:09:14,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 2789. [2022-07-12 13:09:14,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2193 states have (on average 1.2439580483356134) internal successors, (2728), 2225 states have internal predecessors, (2728), 412 states have call successors, (412), 160 states have call predecessors, (412), 183 states have return successors, (489), 427 states have call predecessors, (489), 411 states have call successors, (489) [2022-07-12 13:09:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 3629 transitions. [2022-07-12 13:09:14,935 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 3629 transitions. Word has length 202 [2022-07-12 13:09:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:14,937 INFO L495 AbstractCegarLoop]: Abstraction has 2789 states and 3629 transitions. [2022-07-12 13:09:14,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 13:09:14,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3629 transitions. [2022-07-12 13:09:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-07-12 13:09:14,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:14,942 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:09:14,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 13:09:14,942 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:14,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:14,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1121007566, now seen corresponding path program 1 times [2022-07-12 13:09:14,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:14,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883246604] [2022-07-12 13:09:14,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:14,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:09:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 13:09:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 13:09:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 13:09:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 13:09:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:09:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 13:09:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:09:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 13:09:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 13:09:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 13:09:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-12 13:09:15,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:15,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883246604] [2022-07-12 13:09:15,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883246604] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:09:15,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111824618] [2022-07-12 13:09:15,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:15,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:09:15,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:09:15,236 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:09:15,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 13:09:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:15,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 1795 conjuncts, 112 conjunts are in the unsatisfiable core [2022-07-12 13:09:15,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:09:15,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 13:09:15,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-12 13:09:16,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 13:09:16,038 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1045 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1045))) is different from true [2022-07-12 13:09:16,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 13:09:16,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 13:09:16,138 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 13:09:16,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 13:09:16,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:09:16,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 13:09:24,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 13:09:36,457 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 13:09:36,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 13:09:36,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 13:09:53,024 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 13:09:53,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 13:10:17,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:10:41,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:10:41,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:10:53,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:10:53,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:10:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 59 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2022-07-12 13:10:53,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:10:54,004 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1055 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1055) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-07-12 13:10:54,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111824618] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:10:54,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 13:10:54,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 39] total 50 [2022-07-12 13:10:54,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857979481] [2022-07-12 13:10:54,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 13:10:54,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-12 13:10:54,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:10:54,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-12 13:10:54,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2182, Unknown=20, NotChecked=190, Total=2550 [2022-07-12 13:10:54,019 INFO L87 Difference]: Start difference. First operand 2789 states and 3629 transitions. Second operand has 50 states, 47 states have (on average 5.51063829787234) internal successors, (259), 36 states have internal predecessors, (259), 15 states have call successors, (39), 11 states have call predecessors, (39), 15 states have return successors, (39), 18 states have call predecessors, (39), 15 states have call successors, (39) [2022-07-12 13:12:20,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:12:20,433 INFO L93 Difference]: Finished difference Result 8338 states and 11184 transitions. [2022-07-12 13:12:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-12 13:12:20,434 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 5.51063829787234) internal successors, (259), 36 states have internal predecessors, (259), 15 states have call successors, (39), 11 states have call predecessors, (39), 15 states have return successors, (39), 18 states have call predecessors, (39), 15 states have call successors, (39) Word has length 209 [2022-07-12 13:12:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:12:20,461 INFO L225 Difference]: With dead ends: 8338 [2022-07-12 13:12:20,461 INFO L226 Difference]: Without dead ends: 5568 [2022-07-12 13:12:20,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 247 SyntacticMatches, 18 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 182.3s TimeCoverageRelationStatistics Valid=359, Invalid=5285, Unknown=64, NotChecked=298, Total=6006 [2022-07-12 13:12:20,469 INFO L413 NwaCegarLoop]: 532 mSDtfsCounter, 659 mSDsluCounter, 12041 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 12573 SdHoareTripleChecker+Invalid, 4984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2594 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 13:12:20,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 12573 Invalid, 4984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2269 Invalid, 0 Unknown, 2594 Unchecked, 1.3s Time] [2022-07-12 13:12:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5568 states. [2022-07-12 13:12:20,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5568 to 3019. [2022-07-12 13:12:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 2382 states have (on average 1.2472712006717044) internal successors, (2971), 2422 states have internal predecessors, (2971), 435 states have call successors, (435), 174 states have call predecessors, (435), 201 states have return successors, (518), 450 states have call predecessors, (518), 434 states have call successors, (518) [2022-07-12 13:12:20,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 3924 transitions. [2022-07-12 13:12:20,709 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 3924 transitions. Word has length 209 [2022-07-12 13:12:20,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:12:20,709 INFO L495 AbstractCegarLoop]: Abstraction has 3019 states and 3924 transitions. [2022-07-12 13:12:20,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 5.51063829787234) internal successors, (259), 36 states have internal predecessors, (259), 15 states have call successors, (39), 11 states have call predecessors, (39), 15 states have return successors, (39), 18 states have call predecessors, (39), 15 states have call successors, (39) [2022-07-12 13:12:20,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3924 transitions. [2022-07-12 13:12:20,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-12 13:12:20,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:12:20,714 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:12:20,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 13:12:20,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 13:12:20,928 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:12:20,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:12:20,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1619461338, now seen corresponding path program 2 times [2022-07-12 13:12:20,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:12:20,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497923607] [2022-07-12 13:12:20,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:12:20,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:12:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:12:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:12:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:12:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:12:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 13:12:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 13:12:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 13:12:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:12:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 13:12:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:12:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 13:12:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:12:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 13:12:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 13:12:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 13:12:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 13:12:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-12 13:12:21,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:12:21,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497923607] [2022-07-12 13:12:21,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497923607] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:12:21,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995723930] [2022-07-12 13:12:21,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 13:12:21,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:12:21,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:12:21,180 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:12:21,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 13:12:25,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 13:12:25,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 13:12:25,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 1821 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-12 13:12:25,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:12:25,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 13:12:25,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-12 13:12:25,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 13:12:25,542 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1338 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1338) |c_#memory_int|)) is different from true [2022-07-12 13:12:25,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 13:12:25,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 13:12:25,622 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 13:12:25,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 13:12:25,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:12:25,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 13:12:33,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 13:12:43,817 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 13:12:43,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 13:12:43,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 13:12:48,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 13:12:48,264 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 13:12:48,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 13:12:48,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 13:13:04,577 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 13:13:04,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 13:13:14,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:13:34,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:13:34,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15