./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 f4b24e32 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-?-f4b24e3 [2022-07-14 00:49:31,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 00:49:31,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 00:49:31,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 00:49:31,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 00:49:31,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 00:49:31,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 00:49:31,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 00:49:31,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 00:49:31,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 00:49:31,801 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 00:49:31,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 00:49:31,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 00:49:31,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 00:49:31,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 00:49:31,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 00:49:31,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 00:49:31,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 00:49:31,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 00:49:31,814 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 00:49:31,816 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 00:49:31,817 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 00:49:31,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 00:49:31,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 00:49:31,819 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 00:49:31,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 00:49:31,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 00:49:31,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 00:49:31,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 00:49:31,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 00:49:31,825 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 00:49:31,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 00:49:31,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 00:49:31,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 00:49:31,827 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 00:49:31,828 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 00:49:31,828 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 00:49:31,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 00:49:31,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 00:49:31,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 00:49:31,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 00:49:31,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 00:49:31,832 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 00:49:31,855 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 00:49:31,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 00:49:31,856 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 00:49:31,856 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 00:49:31,857 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 00:49:31,857 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 00:49:31,857 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 00:49:31,857 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 00:49:31,858 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 00:49:31,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 00:49:31,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 00:49:31,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 00:49:31,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 00:49:31,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 00:49:31,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 00:49:31,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 00:49:31,859 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 00:49:31,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 00:49:31,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 00:49:31,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 00:49:31,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 00:49:31,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:49:31,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 00:49:31,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 00:49:31,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 00:49:31,861 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 00:49:31,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 00:49:31,862 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 00:49:31,862 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 00:49:31,862 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 00:49:31,862 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-14 00:49:32,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 00:49:32,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 00:49:32,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 00:49:32,080 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 00:49:32,080 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 00:49:32,081 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-14 00:49:32,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dab8db211/9119451d696542b7931f17dba246db29/FLAG37e649cd7 [2022-07-14 00:49:32,676 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 00:49:32,677 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-14 00:49:32,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dab8db211/9119451d696542b7931f17dba246db29/FLAG37e649cd7 [2022-07-14 00:49:33,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dab8db211/9119451d696542b7931f17dba246db29 [2022-07-14 00:49:33,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 00:49:33,111 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 00:49:33,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 00:49:33,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 00:49:33,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 00:49:33,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:49:33" (1/1) ... [2022-07-14 00:49:33,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@726c3d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:33, skipping insertion in model container [2022-07-14 00:49:33,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:49:33" (1/1) ... [2022-07-14 00:49:33,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 00:49:33,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 00:49:33,753 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-14 00:49:33,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:49:33,822 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 00:49:33,937 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-14 00:49:33,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:49:33,977 INFO L208 MainTranslator]: Completed translation [2022-07-14 00:49:33,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:33 WrapperNode [2022-07-14 00:49:33,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 00:49:33,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 00:49:33,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 00:49:33,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 00:49:33,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:33" (1/1) ... [2022-07-14 00:49:34,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:33" (1/1) ... [2022-07-14 00:49:34,065 INFO L137 Inliner]: procedures = 107, calls = 312, calls flagged for inlining = 47, calls inlined = 41, statements flattened = 771 [2022-07-14 00:49:34,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 00:49:34,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 00:49:34,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 00:49:34,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 00:49:34,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:33" (1/1) ... [2022-07-14 00:49:34,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:33" (1/1) ... [2022-07-14 00:49:34,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:33" (1/1) ... [2022-07-14 00:49:34,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:33" (1/1) ... [2022-07-14 00:49:34,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:33" (1/1) ... [2022-07-14 00:49:34,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:33" (1/1) ... [2022-07-14 00:49:34,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:33" (1/1) ... [2022-07-14 00:49:34,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 00:49:34,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 00:49:34,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 00:49:34,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 00:49:34,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:33" (1/1) ... [2022-07-14 00:49:34,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:49:34,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:49:34,176 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-14 00:49:34,178 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-14 00:49:34,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 00:49:34,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 00:49:34,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 00:49:34,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 00:49:34,209 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 00:49:34,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 00:49:34,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 00:49:34,210 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 00:49:34,210 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 00:49:34,210 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-07-14 00:49:34,210 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-07-14 00:49:34,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 00:49:34,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-14 00:49:34,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-14 00:49:34,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 00:49:34,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 00:49:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-07-14 00:49:34,211 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-07-14 00:49:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-14 00:49:34,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-14 00:49:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 00:49:34,211 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 00:49:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 00:49:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 00:49:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 00:49:34,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 00:49:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 00:49:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-14 00:49:34,212 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-14 00:49:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-14 00:49:34,212 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-14 00:49:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-07-14 00:49:34,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-07-14 00:49:34,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 00:49:34,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 00:49:34,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 00:49:34,213 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-14 00:49:34,213 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-14 00:49:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-14 00:49:34,214 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-14 00:49:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 00:49:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 00:49:34,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 00:49:34,481 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 00:49:34,483 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 00:49:34,581 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 00:49:35,050 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 00:49:35,058 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 00:49:35,058 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 00:49:35,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:49:35 BoogieIcfgContainer [2022-07-14 00:49:35,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 00:49:35,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 00:49:35,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 00:49:35,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 00:49:35,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:49:33" (1/3) ... [2022-07-14 00:49:35,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb3753d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:49:35, skipping insertion in model container [2022-07-14 00:49:35,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:33" (2/3) ... [2022-07-14 00:49:35,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb3753d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:49:35, skipping insertion in model container [2022-07-14 00:49:35,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:49:35" (3/3) ... [2022-07-14 00:49:35,068 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-14 00:49:35,079 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 00:49:35,079 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-14 00:49:35,123 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 00:49:35,127 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@373d97df, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@555aac12 [2022-07-14 00:49:35,128 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-14 00:49:35,132 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-14 00:49:35,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 00:49:35,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:35,138 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-14 00:49:35,139 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:35,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:35,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1083564762, now seen corresponding path program 1 times [2022-07-14 00:49:35,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:35,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812129287] [2022-07-14 00:49:35,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:35,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,363 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-14 00:49:35,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:35,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812129287] [2022-07-14 00:49:35,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812129287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:35,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:35,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 00:49:35,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911133114] [2022-07-14 00:49:35,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:35,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:49:35,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:35,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:49:35,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 00:49:35,394 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-14 00:49:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:35,658 INFO L93 Difference]: Finished difference Result 472 states and 644 transitions. [2022-07-14 00:49:35,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:49:35,660 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-14 00:49:35,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:35,668 INFO L225 Difference]: With dead ends: 472 [2022-07-14 00:49:35,668 INFO L226 Difference]: Without dead ends: 231 [2022-07-14 00:49:35,681 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-14 00:49:35,688 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-14 00:49:35,689 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-14 00:49:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-14 00:49:35,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2022-07-14 00:49:35,748 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-14 00:49:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 291 transitions. [2022-07-14 00:49:35,753 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 291 transitions. Word has length 32 [2022-07-14 00:49:35,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:35,753 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 291 transitions. [2022-07-14 00:49:35,753 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-14 00:49:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 291 transitions. [2022-07-14 00:49:35,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 00:49:35,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:35,756 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-14 00:49:35,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 00:49:35,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:35,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:35,757 INFO L85 PathProgramCache]: Analyzing trace with hash -660862936, now seen corresponding path program 1 times [2022-07-14 00:49:35,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:35,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418653928] [2022-07-14 00:49:35,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:35,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,867 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-14 00:49:35,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:35,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418653928] [2022-07-14 00:49:35,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418653928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:35,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:35,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:49:35,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469987849] [2022-07-14 00:49:35,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:35,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:49:35,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:35,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:49:35,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:49:35,870 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-14 00:49:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:36,457 INFO L93 Difference]: Finished difference Result 650 states and 851 transitions. [2022-07-14 00:49:36,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:49:36,458 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-14 00:49:36,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:36,460 INFO L225 Difference]: With dead ends: 650 [2022-07-14 00:49:36,460 INFO L226 Difference]: Without dead ends: 431 [2022-07-14 00:49:36,461 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-14 00:49:36,462 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 306 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:36,462 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.5s Time] [2022-07-14 00:49:36,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-07-14 00:49:36,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 417. [2022-07-14 00:49:36,481 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-14 00:49:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 541 transitions. [2022-07-14 00:49:36,483 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 541 transitions. Word has length 32 [2022-07-14 00:49:36,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:36,483 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 541 transitions. [2022-07-14 00:49:36,483 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-14 00:49:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 541 transitions. [2022-07-14 00:49:36,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 00:49:36,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:36,485 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-14 00:49:36,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 00:49:36,486 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:36,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:36,486 INFO L85 PathProgramCache]: Analyzing trace with hash 748866141, now seen corresponding path program 1 times [2022-07-14 00:49:36,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:36,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617976679] [2022-07-14 00:49:36,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:36,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,574 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-14 00:49:36,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:36,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617976679] [2022-07-14 00:49:36,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617976679] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:36,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:36,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:49:36,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195337350] [2022-07-14 00:49:36,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:36,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:49:36,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:36,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:49:36,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:49:36,577 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-14 00:49:37,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:37,092 INFO L93 Difference]: Finished difference Result 990 states and 1323 transitions. [2022-07-14 00:49:37,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 00:49:37,093 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-14 00:49:37,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:37,100 INFO L225 Difference]: With dead ends: 990 [2022-07-14 00:49:37,100 INFO L226 Difference]: Without dead ends: 588 [2022-07-14 00:49:37,101 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-14 00:49:37,105 INFO L413 NwaCegarLoop]: 455 mSDtfsCounter, 622 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-14 00:49:37,107 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-14 00:49:37,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-07-14 00:49:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 420. [2022-07-14 00:49:37,144 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-14 00:49:37,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 543 transitions. [2022-07-14 00:49:37,147 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 543 transitions. Word has length 55 [2022-07-14 00:49:37,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:37,148 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 543 transitions. [2022-07-14 00:49:37,148 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-14 00:49:37,149 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 543 transitions. [2022-07-14 00:49:37,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 00:49:37,155 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:37,155 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-14 00:49:37,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 00:49:37,155 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:37,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:37,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1486182813, now seen corresponding path program 1 times [2022-07-14 00:49:37,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:37,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833693519] [2022-07-14 00:49:37,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:37,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,296 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-14 00:49:37,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:37,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833693519] [2022-07-14 00:49:37,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833693519] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:37,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:37,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:49:37,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762234697] [2022-07-14 00:49:37,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:37,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:49:37,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:37,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:49:37,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:49:37,304 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-14 00:49:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:37,666 INFO L93 Difference]: Finished difference Result 1257 states and 1644 transitions. [2022-07-14 00:49:37,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:49:37,666 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-14 00:49:37,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:37,674 INFO L225 Difference]: With dead ends: 1257 [2022-07-14 00:49:37,674 INFO L226 Difference]: Without dead ends: 852 [2022-07-14 00:49:37,675 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-14 00:49:37,678 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-14 00:49:37,679 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-14 00:49:37,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2022-07-14 00:49:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 814. [2022-07-14 00:49:37,713 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-14 00:49:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1056 transitions. [2022-07-14 00:49:37,716 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1056 transitions. Word has length 55 [2022-07-14 00:49:37,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:37,716 INFO L495 AbstractCegarLoop]: Abstraction has 814 states and 1056 transitions. [2022-07-14 00:49:37,716 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-14 00:49:37,716 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1056 transitions. [2022-07-14 00:49:37,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 00:49:37,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:37,718 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-14 00:49:37,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 00:49:37,718 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:37,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:37,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1172967990, now seen corresponding path program 1 times [2022-07-14 00:49:37,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:37,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081063812] [2022-07-14 00:49:37,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:37,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,797 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-14 00:49:37,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:37,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081063812] [2022-07-14 00:49:37,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081063812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:37,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:37,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:49:37,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113831397] [2022-07-14 00:49:37,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:37,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:49:37,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:37,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:49:37,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:49:37,799 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-14 00:49:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:37,978 INFO L93 Difference]: Finished difference Result 844 states and 1101 transitions. [2022-07-14 00:49:37,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:49:37,979 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-14 00:49:37,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:37,982 INFO L225 Difference]: With dead ends: 844 [2022-07-14 00:49:37,982 INFO L226 Difference]: Without dead ends: 841 [2022-07-14 00:49:37,982 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-14 00:49:37,983 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-14 00:49:37,983 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-14 00:49:37,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-07-14 00:49:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 813. [2022-07-14 00:49:38,030 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-14 00:49:38,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1054 transitions. [2022-07-14 00:49:38,033 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1054 transitions. Word has length 56 [2022-07-14 00:49:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:38,034 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1054 transitions. [2022-07-14 00:49:38,034 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-14 00:49:38,034 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1054 transitions. [2022-07-14 00:49:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-14 00:49:38,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:38,035 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-14 00:49:38,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 00:49:38,036 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:38,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:38,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2002259392, now seen corresponding path program 1 times [2022-07-14 00:49:38,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:38,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533465259] [2022-07-14 00:49:38,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:38,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,122 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-14 00:49:38,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:38,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533465259] [2022-07-14 00:49:38,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533465259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:38,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:38,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:49:38,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821357824] [2022-07-14 00:49:38,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:38,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:49:38,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:38,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:49:38,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:49:38,126 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-14 00:49:38,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:38,311 INFO L93 Difference]: Finished difference Result 843 states and 1099 transitions. [2022-07-14 00:49:38,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:49:38,312 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-14 00:49:38,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:38,316 INFO L225 Difference]: With dead ends: 843 [2022-07-14 00:49:38,317 INFO L226 Difference]: Without dead ends: 840 [2022-07-14 00:49:38,317 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-14 00:49:38,318 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-14 00:49:38,318 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-14 00:49:38,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-07-14 00:49:38,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 812. [2022-07-14 00:49:38,337 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-14 00:49:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1052 transitions. [2022-07-14 00:49:38,339 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1052 transitions. Word has length 57 [2022-07-14 00:49:38,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:38,339 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 1052 transitions. [2022-07-14 00:49:38,339 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-14 00:49:38,340 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1052 transitions. [2022-07-14 00:49:38,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 00:49:38,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:38,341 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-14 00:49:38,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 00:49:38,341 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:38,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:38,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1940484211, now seen corresponding path program 1 times [2022-07-14 00:49:38,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:38,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205879447] [2022-07-14 00:49:38,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:38,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,423 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-14 00:49:38,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:38,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205879447] [2022-07-14 00:49:38,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205879447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:38,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:38,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:49:38,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919706296] [2022-07-14 00:49:38,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:38,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:49:38,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:38,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:49:38,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:49:38,425 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-14 00:49:38,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:38,585 INFO L93 Difference]: Finished difference Result 842 states and 1097 transitions. [2022-07-14 00:49:38,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:49:38,586 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-14 00:49:38,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:38,589 INFO L225 Difference]: With dead ends: 842 [2022-07-14 00:49:38,589 INFO L226 Difference]: Without dead ends: 839 [2022-07-14 00:49:38,590 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-14 00:49:38,590 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.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:38,590 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.1s Time] [2022-07-14 00:49:38,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-07-14 00:49:38,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 811. [2022-07-14 00:49:38,611 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-14 00:49:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1050 transitions. [2022-07-14 00:49:38,614 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1050 transitions. Word has length 58 [2022-07-14 00:49:38,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:38,614 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 1050 transitions. [2022-07-14 00:49:38,614 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-14 00:49:38,615 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1050 transitions. [2022-07-14 00:49:38,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 00:49:38,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:38,615 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-14 00:49:38,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 00:49:38,616 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:38,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:38,616 INFO L85 PathProgramCache]: Analyzing trace with hash -25448733, now seen corresponding path program 1 times [2022-07-14 00:49:38,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:38,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991655211] [2022-07-14 00:49:38,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:38,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,714 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-14 00:49:38,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:38,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991655211] [2022-07-14 00:49:38,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991655211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:38,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:38,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:49:38,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778100561] [2022-07-14 00:49:38,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:38,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:49:38,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:38,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:49:38,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:49:38,716 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-14 00:49:38,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:38,913 INFO L93 Difference]: Finished difference Result 841 states and 1095 transitions. [2022-07-14 00:49:38,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:49:38,914 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-14 00:49:38,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:38,916 INFO L225 Difference]: With dead ends: 841 [2022-07-14 00:49:38,917 INFO L226 Difference]: Without dead ends: 829 [2022-07-14 00:49:38,917 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-14 00:49:38,917 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-14 00:49:38,917 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-14 00:49:38,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2022-07-14 00:49:38,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 801. [2022-07-14 00:49:38,972 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-14 00:49:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1037 transitions. [2022-07-14 00:49:38,975 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1037 transitions. Word has length 59 [2022-07-14 00:49:38,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:38,976 INFO L495 AbstractCegarLoop]: Abstraction has 801 states and 1037 transitions. [2022-07-14 00:49:38,976 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-14 00:49:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1037 transitions. [2022-07-14 00:49:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-14 00:49:38,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:38,982 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-14 00:49:38,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 00:49:38,983 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:38,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:38,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1150661192, now seen corresponding path program 1 times [2022-07-14 00:49:38,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:38,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658744307] [2022-07-14 00:49:38,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:38,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:49:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 00:49:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 00:49:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:49:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 00:49:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 00:49:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 00:49:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:49:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 00:49:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:49:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 00:49:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,127 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-14 00:49:39,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:39,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658744307] [2022-07-14 00:49:39,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658744307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:39,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:39,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:49:39,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226814421] [2022-07-14 00:49:39,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:39,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:49:39,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:39,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:49:39,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:49:39,130 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-14 00:49:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:39,389 INFO L93 Difference]: Finished difference Result 1679 states and 2189 transitions. [2022-07-14 00:49:39,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:49:39,390 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-14 00:49:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:39,393 INFO L225 Difference]: With dead ends: 1679 [2022-07-14 00:49:39,393 INFO L226 Difference]: Without dead ends: 893 [2022-07-14 00:49:39,395 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-14 00:49:39,395 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-14 00:49:39,396 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-14 00:49:39,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2022-07-14 00:49:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 855. [2022-07-14 00:49:39,431 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-14 00:49:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1111 transitions. [2022-07-14 00:49:39,435 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1111 transitions. Word has length 160 [2022-07-14 00:49:39,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:39,435 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 1111 transitions. [2022-07-14 00:49:39,435 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-14 00:49:39,435 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1111 transitions. [2022-07-14 00:49:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-14 00:49:39,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:39,437 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-14 00:49:39,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 00:49:39,437 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:39,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:39,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1334474301, now seen corresponding path program 1 times [2022-07-14 00:49:39,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:39,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411991158] [2022-07-14 00:49:39,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:39,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:49:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:49:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 00:49:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 00:49:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 00:49:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:49:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 00:49:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:49:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 00:49:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-14 00:49:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,604 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-14 00:49:39,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:39,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411991158] [2022-07-14 00:49:39,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411991158] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:39,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:39,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 00:49:39,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244959713] [2022-07-14 00:49:39,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:39,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 00:49:39,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:39,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 00:49:39,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:49:39,606 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-14 00:49:39,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:39,921 INFO L93 Difference]: Finished difference Result 2293 states and 3074 transitions. [2022-07-14 00:49:39,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:49:39,922 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-14 00:49:39,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:39,927 INFO L225 Difference]: With dead ends: 2293 [2022-07-14 00:49:39,927 INFO L226 Difference]: Without dead ends: 1457 [2022-07-14 00:49:39,931 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-14 00:49:39,931 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-14 00:49:39,932 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-14 00:49:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2022-07-14 00:49:39,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 867. [2022-07-14 00:49:39,989 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-14 00:49:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1123 transitions. [2022-07-14 00:49:39,992 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1123 transitions. Word has length 169 [2022-07-14 00:49:39,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:39,992 INFO L495 AbstractCegarLoop]: Abstraction has 867 states and 1123 transitions. [2022-07-14 00:49:39,992 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-14 00:49:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1123 transitions. [2022-07-14 00:49:39,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-14 00:49:39,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:39,995 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-14 00:49:39,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 00:49:39,996 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:39,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:39,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1080620452, now seen corresponding path program 1 times [2022-07-14 00:49:39,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:39,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610194556] [2022-07-14 00:49:39,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:39,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:49:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:49:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:49:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 00:49:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 00:49:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:49:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:49:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 00:49:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 00:49:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-14 00:49:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,201 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-14 00:49:40,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:40,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610194556] [2022-07-14 00:49:40,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610194556] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:49:40,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509275995] [2022-07-14 00:49:40,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:40,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:49:40,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:49:40,203 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-14 00:49:40,209 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-14 00:49:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 00:49:40,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:49:40,551 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-14 00:49:40,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:49:40,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509275995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:40,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:49:40,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-14 00:49:40,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746495054] [2022-07-14 00:49:40,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:40,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:49:40,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:40,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:49:40,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:49:40,553 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-14 00:49:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:40,707 INFO L93 Difference]: Finished difference Result 2809 states and 3672 transitions. [2022-07-14 00:49:40,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:49:40,708 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-14 00:49:40,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:40,714 INFO L225 Difference]: With dead ends: 2809 [2022-07-14 00:49:40,715 INFO L226 Difference]: Without dead ends: 1961 [2022-07-14 00:49:40,717 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-14 00:49:40,717 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.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:40,718 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.0s Time] [2022-07-14 00:49:40,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2022-07-14 00:49:40,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 903. [2022-07-14 00:49:40,762 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-14 00:49:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1167 transitions. [2022-07-14 00:49:40,765 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1167 transitions. Word has length 171 [2022-07-14 00:49:40,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:40,765 INFO L495 AbstractCegarLoop]: Abstraction has 903 states and 1167 transitions. [2022-07-14 00:49:40,765 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-14 00:49:40,765 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1167 transitions. [2022-07-14 00:49:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-14 00:49:40,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:40,767 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-14 00:49:40,787 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-14 00:49:40,983 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-14 00:49:40,983 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:40,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:40,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2091737702, now seen corresponding path program 1 times [2022-07-14 00:49:40,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:40,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205648051] [2022-07-14 00:49:40,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:40,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:49:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:49:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:49:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 00:49:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 00:49:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:49:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:49:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 00:49:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 00:49:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-14 00:49:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,171 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-14 00:49:41,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:41,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205648051] [2022-07-14 00:49:41,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205648051] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:49:41,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516754343] [2022-07-14 00:49:41,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:41,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:49:41,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:49:41,173 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-14 00:49:41,174 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-14 00:49:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 00:49:41,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:49:41,512 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-14 00:49:41,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:49:41,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516754343] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:41,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:49:41,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-07-14 00:49:41,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030939333] [2022-07-14 00:49:41,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:41,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:49:41,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:41,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:49:41,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:49:41,514 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-14 00:49:41,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:41,578 INFO L93 Difference]: Finished difference Result 1803 states and 2343 transitions. [2022-07-14 00:49:41,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:49:41,579 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-14 00:49:41,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:41,582 INFO L225 Difference]: With dead ends: 1803 [2022-07-14 00:49:41,582 INFO L226 Difference]: Without dead ends: 911 [2022-07-14 00:49:41,584 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-14 00:49:41,584 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-14 00:49:41,585 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-14 00:49:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2022-07-14 00:49:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 911. [2022-07-14 00:49:41,624 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-14 00:49:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1183 transitions. [2022-07-14 00:49:41,627 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1183 transitions. Word has length 171 [2022-07-14 00:49:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:41,627 INFO L495 AbstractCegarLoop]: Abstraction has 911 states and 1183 transitions. [2022-07-14 00:49:41,628 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-14 00:49:41,628 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1183 transitions. [2022-07-14 00:49:41,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-14 00:49:41,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:41,630 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-14 00:49:41,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 00:49:41,847 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-14 00:49:41,847 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:41,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:41,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2083587314, now seen corresponding path program 1 times [2022-07-14 00:49:41,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:41,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52386367] [2022-07-14 00:49:41,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:41,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:49:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:49:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 00:49:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 00:49:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:49:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 00:49:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 00:49:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 00:49:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-14 00:49:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-14 00:49:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,081 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-14 00:49:42,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:42,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52386367] [2022-07-14 00:49:42,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52386367] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:49:42,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170258469] [2022-07-14 00:49:42,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:42,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:49:42,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:49:42,084 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-14 00:49:42,085 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-14 00:49:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-14 00:49:42,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:49:42,454 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-14 00:49:42,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:49:42,702 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-14 00:49:42,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170258469] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:49:42,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:49:42,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 20 [2022-07-14 00:49:42,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308519448] [2022-07-14 00:49:42,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:49:42,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 00:49:42,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:42,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 00:49:42,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-07-14 00:49:42,704 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-14 00:49:43,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:43,539 INFO L93 Difference]: Finished difference Result 2037 states and 2676 transitions. [2022-07-14 00:49:43,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 00:49:43,539 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-14 00:49:43,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:43,544 INFO L225 Difference]: With dead ends: 2037 [2022-07-14 00:49:43,544 INFO L226 Difference]: Without dead ends: 1145 [2022-07-14 00:49:43,546 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-14 00:49:43,547 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.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:43,547 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.7s Time] [2022-07-14 00:49:43,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2022-07-14 00:49:43,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 951. [2022-07-14 00:49:43,607 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-14 00:49:43,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1235 transitions. [2022-07-14 00:49:43,611 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1235 transitions. Word has length 177 [2022-07-14 00:49:43,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:43,611 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1235 transitions. [2022-07-14 00:49:43,611 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-14 00:49:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1235 transitions. [2022-07-14 00:49:43,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-14 00:49:43,614 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:43,614 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-14 00:49:43,633 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-14 00:49:43,833 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-14 00:49:43,833 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:43,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:43,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1620349506, now seen corresponding path program 2 times [2022-07-14 00:49:43,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:43,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291660748] [2022-07-14 00:49:43,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:43,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:43,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:43,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:43,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:43,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:43,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:43,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:43,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:49:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:43,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:43,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:49:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:43,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 00:49:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:43,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 00:49:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:43,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:43,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:43,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 00:49:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:44,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:44,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:49:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:44,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 00:49:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:44,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 00:49:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:44,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:49:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:44,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-14 00:49:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:44,076 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-14 00:49:44,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:44,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291660748] [2022-07-14 00:49:44,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291660748] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:49:44,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141249877] [2022-07-14 00:49:44,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 00:49:44,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:49:44,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:49:44,078 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-14 00:49:44,079 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-14 00:49:44,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 00:49:44,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:49:44,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 00:49:44,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:49:44,406 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-14 00:49:44,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:49:44,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141249877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:44,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:49:44,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2022-07-14 00:49:44,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946100362] [2022-07-14 00:49:44,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:44,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:49:44,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:44,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:49:44,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-07-14 00:49:44,408 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-14 00:49:44,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:44,707 INFO L93 Difference]: Finished difference Result 2075 states and 2732 transitions. [2022-07-14 00:49:44,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:49:44,708 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-14 00:49:44,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:44,712 INFO L225 Difference]: With dead ends: 2075 [2022-07-14 00:49:44,712 INFO L226 Difference]: Without dead ends: 1143 [2022-07-14 00:49:44,714 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-14 00:49:44,714 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-14 00:49:44,714 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-14 00:49:44,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2022-07-14 00:49:44,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 945. [2022-07-14 00:49:44,771 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-14 00:49:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1225 transitions. [2022-07-14 00:49:44,774 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1225 transitions. Word has length 183 [2022-07-14 00:49:44,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:44,774 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1225 transitions. [2022-07-14 00:49:44,774 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-14 00:49:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1225 transitions. [2022-07-14 00:49:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-14 00:49:44,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:44,777 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-14 00:49:44,803 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-14 00:49:44,980 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-14 00:49:44,981 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:44,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:44,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1006053722, now seen corresponding path program 1 times [2022-07-14 00:49:44,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:44,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560305327] [2022-07-14 00:49:44,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:44,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:49:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:49:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 00:49:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 00:49:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 00:49:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:49:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 00:49:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 00:49:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-14 00:49:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 00:49:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,172 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-14 00:49:45,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:45,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560305327] [2022-07-14 00:49:45,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560305327] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:49:45,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869441001] [2022-07-14 00:49:45,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:45,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:49:45,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:49:45,174 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-14 00:49:45,175 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-14 00:49:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:45,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 1781 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 00:49:45,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:49:45,667 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-14 00:49:45,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:49:45,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869441001] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:45,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:49:45,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-14 00:49:45,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633851951] [2022-07-14 00:49:45,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:45,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:49:45,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:45,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:49:45,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:49:45,668 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-14 00:49:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:45,916 INFO L93 Difference]: Finished difference Result 2799 states and 3638 transitions. [2022-07-14 00:49:45,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:49:45,916 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-14 00:49:45,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:45,924 INFO L225 Difference]: With dead ends: 2799 [2022-07-14 00:49:45,924 INFO L226 Difference]: Without dead ends: 2791 [2022-07-14 00:49:45,925 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-14 00:49:45,925 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-14 00:49:45,925 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-14 00:49:45,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2022-07-14 00:49:46,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2777. [2022-07-14 00:49:46,084 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-14 00:49:46,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 3617 transitions. [2022-07-14 00:49:46,089 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 3617 transitions. Word has length 202 [2022-07-14 00:49:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:46,089 INFO L495 AbstractCegarLoop]: Abstraction has 2777 states and 3617 transitions. [2022-07-14 00:49:46,089 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-14 00:49:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3617 transitions. [2022-07-14 00:49:46,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-14 00:49:46,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:46,093 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-14 00:49:46,120 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-14 00:49:46,301 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-14 00:49:46,302 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:46,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:46,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2017170972, now seen corresponding path program 1 times [2022-07-14 00:49:46,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:46,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737747711] [2022-07-14 00:49:46,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:46,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:49:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:49:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 00:49:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 00:49:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 00:49:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:49:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 00:49:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 00:49:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-14 00:49:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 00:49:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:46,506 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-14 00:49:46,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:46,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737747711] [2022-07-14 00:49:46,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737747711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:46,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:46,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:49:46,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230680193] [2022-07-14 00:49:46,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:46,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:49:46,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:46,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:49:46,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:49:46,509 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-14 00:49:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:47,351 INFO L93 Difference]: Finished difference Result 8799 states and 11542 transitions. [2022-07-14 00:49:47,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 00:49:47,351 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-14 00:49:47,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:47,370 INFO L225 Difference]: With dead ends: 8799 [2022-07-14 00:49:47,370 INFO L226 Difference]: Without dead ends: 6041 [2022-07-14 00:49:47,377 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-14 00:49:47,378 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-14 00:49:47,378 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-14 00:49:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2022-07-14 00:49:47,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 2789. [2022-07-14 00:49:47,589 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-14 00:49:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 3629 transitions. [2022-07-14 00:49:47,596 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 3629 transitions. Word has length 202 [2022-07-14 00:49:47,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:47,596 INFO L495 AbstractCegarLoop]: Abstraction has 2789 states and 3629 transitions. [2022-07-14 00:49:47,596 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-14 00:49:47,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3629 transitions. [2022-07-14 00:49:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-07-14 00:49:47,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:47,600 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-14 00:49:47,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 00:49:47,600 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:47,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:47,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1121007566, now seen corresponding path program 1 times [2022-07-14 00:49:47,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:47,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627830527] [2022-07-14 00:49:47,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:47,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:49:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:49:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 00:49:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 00:49:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 00:49:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:49:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 00:49:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 00:49:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-14 00:49:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-14 00:49:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 00:49:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:47,843 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-14 00:49:47,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:47,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627830527] [2022-07-14 00:49:47,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627830527] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:49:47,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592530949] [2022-07-14 00:49:47,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:47,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:49:47,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:49:47,844 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-14 00:49:47,845 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-14 00:49:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:48,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 1795 conjuncts, 112 conjunts are in the unsatisfiable core [2022-07-14 00:49:48,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:49:48,248 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-14 00:49:48,290 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-14 00:49:48,634 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-14 00:49:48,638 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-14 00:49:48,679 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-14 00:49:48,681 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-14 00:49:48,715 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 00:49:48,716 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-14 00:49:48,719 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-14 00:49:48,792 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-14 00:49:56,886 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-14 00:50:08,965 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 00:50:08,965 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-14 00:50:09,193 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-14 00:50:25,495 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 00:50:25,496 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-14 00:50:50,071 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-14 00:51:14,290 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-14 00:51:14,297 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-14 00:51:26,456 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-14 00:51:26,463 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-14 00:51:26,507 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-14 00:51:26,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:51:26,519 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-14 00:51:26,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592530949] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:51:26,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:51:26,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 39] total 50 [2022-07-14 00:51:26,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27257287] [2022-07-14 00:51:26,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:51:26,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-14 00:51:26,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:51:26,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-14 00:51:26,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2182, Unknown=20, NotChecked=190, Total=2550 [2022-07-14 00:51:26,534 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-14 00:52:52,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:52:52,921 INFO L93 Difference]: Finished difference Result 8338 states and 11184 transitions. [2022-07-14 00:52:52,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-14 00:52:52,921 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-14 00:52:52,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:52:52,942 INFO L225 Difference]: With dead ends: 8338 [2022-07-14 00:52:52,942 INFO L226 Difference]: Without dead ends: 5568 [2022-07-14 00:52:52,949 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-14 00:52:52,950 INFO L413 NwaCegarLoop]: 532 mSDtfsCounter, 659 mSDsluCounter, 12041 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 12573 SdHoareTripleChecker+Invalid, 4979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2589 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:52:52,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 12573 Invalid, 4979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2269 Invalid, 0 Unknown, 2589 Unchecked, 1.2s Time] [2022-07-14 00:52:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5568 states. [2022-07-14 00:52:53,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5568 to 3019. [2022-07-14 00:52:53,206 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-14 00:52:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 3924 transitions. [2022-07-14 00:52:53,213 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 3924 transitions. Word has length 209 [2022-07-14 00:52:53,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:52:53,214 INFO L495 AbstractCegarLoop]: Abstraction has 3019 states and 3924 transitions. [2022-07-14 00:52:53,214 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-14 00:52:53,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3924 transitions. [2022-07-14 00:52:53,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-14 00:52:53,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:52:53,219 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-14 00:52:53,240 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-14 00:52:53,439 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-14 00:52:53,439 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:52:53,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:52:53,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1619461338, now seen corresponding path program 2 times [2022-07-14 00:52:53,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:52:53,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369701445] [2022-07-14 00:52:53,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:52:53,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:52:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:52:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:52:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:52:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:52:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:52:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:52:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:52:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:52:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:52:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 00:52:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 00:52:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:52:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:52:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 00:52:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:52:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:52:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 00:52:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 00:52:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-14 00:52:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-14 00:52:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-14 00:52:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 00:52:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:53,649 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-14 00:52:53,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:52:53,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369701445] [2022-07-14 00:52:53,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369701445] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:52:53,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196380593] [2022-07-14 00:52:53,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 00:52:53,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:52:53,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:52:53,652 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-14 00:52:53,653 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-14 00:52:57,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 00:52:57,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:52:57,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 1821 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-14 00:52:57,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:52:57,445 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-14 00:52:57,463 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-14 00:52:57,655 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-14 00:52:57,660 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-14 00:52:57,690 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-14 00:52:57,692 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-14 00:52:57,719 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 00:52:57,720 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-14 00:52:57,725 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-14 00:52:57,774 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-14 00:53:05,836 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-14 00:53:15,899 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 00:53:15,900 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-14 00:53:16,057 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-14 00:53:20,116 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-14 00:53:20,337 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 00:53:20,338 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-14 00:53:20,408 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-14 00:53:36,650 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 00:53:36,650 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-14 00:53:46,841 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-14 00:54:07,009 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-14 00:54:07,016 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