./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.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 0408b8dd1e50dba1d05ee8137dbd65dd8b8c61dcceb5e60c09fc08110798cce8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 23:33:42,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 23:33:42,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 23:33:42,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 23:33:42,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 23:33:42,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 23:33:42,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 23:33:42,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 23:33:42,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 23:33:42,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 23:33:42,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 23:33:42,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 23:33:42,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 23:33:42,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 23:33:42,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 23:33:42,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 23:33:42,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 23:33:42,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 23:33:42,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 23:33:42,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 23:33:42,897 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 23:33:42,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 23:33:42,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 23:33:42,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 23:33:42,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 23:33:42,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 23:33:42,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 23:33:42,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 23:33:42,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 23:33:42,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 23:33:42,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 23:33:42,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 23:33:42,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 23:33:42,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 23:33:42,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 23:33:42,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 23:33:42,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 23:33:42,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 23:33:42,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 23:33:42,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 23:33:42,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 23:33:42,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 23:33:42,916 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 23:33:42,940 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 23:33:42,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 23:33:42,941 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 23:33:42,941 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 23:33:42,941 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 23:33:42,942 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 23:33:42,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 23:33:42,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 23:33:42,942 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 23:33:42,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 23:33:42,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 23:33:42,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 23:33:42,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 23:33:42,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 23:33:42,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 23:33:42,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 23:33:42,944 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 23:33:42,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 23:33:42,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 23:33:42,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 23:33:42,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 23:33:42,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:33:42,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 23:33:42,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 23:33:42,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 23:33:42,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 23:33:42,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 23:33:42,946 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 23:33:42,946 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 23:33:42,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 23:33:42,946 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 -> 0408b8dd1e50dba1d05ee8137dbd65dd8b8c61dcceb5e60c09fc08110798cce8 [2022-07-19 23:33:43,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 23:33:43,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 23:33:43,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 23:33:43,151 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 23:33:43,152 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 23:33:43,153 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i [2022-07-19 23:33:43,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47c204ee5/7d74f7854e6a42b0bea34c1fc821f416/FLAGd5a82a5aa [2022-07-19 23:33:43,834 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 23:33:43,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i [2022-07-19 23:33:43,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47c204ee5/7d74f7854e6a42b0bea34c1fc821f416/FLAGd5a82a5aa [2022-07-19 23:33:44,246 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47c204ee5/7d74f7854e6a42b0bea34c1fc821f416 [2022-07-19 23:33:44,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 23:33:44,249 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 23:33:44,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 23:33:44,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 23:33:44,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 23:33:44,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:33:44" (1/1) ... [2022-07-19 23:33:44,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c0e2073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:33:44, skipping insertion in model container [2022-07-19 23:33:44,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:33:44" (1/1) ... [2022-07-19 23:33:44,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 23:33:44,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 23:33:44,746 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i[149470,149483] [2022-07-19 23:33:44,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:33:44,959 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 23:33:45,064 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i[149470,149483] [2022-07-19 23:33:45,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:33:45,169 INFO L208 MainTranslator]: Completed translation [2022-07-19 23:33:45,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:33:45 WrapperNode [2022-07-19 23:33:45,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 23:33:45,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 23:33:45,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 23:33:45,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 23:33:45,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:33:45" (1/1) ... [2022-07-19 23:33:45,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:33:45" (1/1) ... [2022-07-19 23:33:45,271 INFO L137 Inliner]: procedures = 88, calls = 403, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 1034 [2022-07-19 23:33:45,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 23:33:45,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 23:33:45,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 23:33:45,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 23:33:45,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:33:45" (1/1) ... [2022-07-19 23:33:45,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:33:45" (1/1) ... [2022-07-19 23:33:45,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:33:45" (1/1) ... [2022-07-19 23:33:45,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:33:45" (1/1) ... [2022-07-19 23:33:45,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:33:45" (1/1) ... [2022-07-19 23:33:45,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:33:45" (1/1) ... [2022-07-19 23:33:45,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:33:45" (1/1) ... [2022-07-19 23:33:45,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 23:33:45,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 23:33:45,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 23:33:45,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 23:33:45,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:33:45" (1/1) ... [2022-07-19 23:33:45,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:33:45,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:33:45,403 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-19 23:33:45,405 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-19 23:33:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-07-19 23:33:45,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-07-19 23:33:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 23:33:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure load_pkt [2022-07-19 23:33:45,444 INFO L138 BoogieDeclarations]: Found implementation of procedure load_pkt [2022-07-19 23:33:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-19 23:33:45,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 23:33:45,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 23:33:45,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-19 23:33:45,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-19 23:33:45,448 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-19 23:33:45,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-19 23:33:45,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 23:33:45,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 23:33:45,449 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-19 23:33:45,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-19 23:33:45,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-19 23:33:45,450 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-19 23:33:45,450 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-19 23:33:45,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-19 23:33:45,450 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_12 [2022-07-19 23:33:45,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_12 [2022-07-19 23:33:45,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 23:33:45,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 23:33:45,450 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-19 23:33:45,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-19 23:33:45,451 INFO L130 BoogieDeclarations]: Found specification of procedure type_trans [2022-07-19 23:33:45,451 INFO L138 BoogieDeclarations]: Found implementation of procedure type_trans [2022-07-19 23:33:45,451 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-19 23:33:45,451 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-19 23:33:45,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 23:33:45,451 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-19 23:33:45,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-19 23:33:45,451 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-19 23:33:45,452 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-19 23:33:45,452 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 23:33:45,452 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 23:33:45,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 23:33:45,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 23:33:45,452 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2022-07-19 23:33:45,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2022-07-19 23:33:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-19 23:33:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-19 23:33:45,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-19 23:33:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-07-19 23:33:45,453 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-07-19 23:33:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 23:33:45,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 23:33:45,729 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 23:33:45,731 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 23:33:45,918 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-19 23:33:46,526 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 23:33:46,532 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 23:33:46,533 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 23:33:46,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:33:46 BoogieIcfgContainer [2022-07-19 23:33:46,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 23:33:46,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 23:33:46,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 23:33:46,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 23:33:46,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:33:44" (1/3) ... [2022-07-19 23:33:46,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d460a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:33:46, skipping insertion in model container [2022-07-19 23:33:46,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:33:45" (2/3) ... [2022-07-19 23:33:46,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d460a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:33:46, skipping insertion in model container [2022-07-19 23:33:46,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:33:46" (3/3) ... [2022-07-19 23:33:46,540 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i [2022-07-19 23:33:46,549 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 23:33:46,550 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 23:33:46,585 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 23:33:46,590 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@416f5e40, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e07efba [2022-07-19 23:33:46,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 23:33:46,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 243 states have (on average 1.4444444444444444) internal successors, (351), 248 states have internal predecessors, (351), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-07-19 23:33:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 23:33:46,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:33:46,602 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] [2022-07-19 23:33:46,602 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:33:46,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:33:46,606 INFO L85 PathProgramCache]: Analyzing trace with hash 722424881, now seen corresponding path program 1 times [2022-07-19 23:33:46,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:33:46,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413302358] [2022-07-19 23:33:46,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:33:46,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:33:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:46,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:33:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:46,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-19 23:33:46,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:33:46,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413302358] [2022-07-19 23:33:46,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413302358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:33:46,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:33:46,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 23:33:46,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995315072] [2022-07-19 23:33:46,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:33:46,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:33:46,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:33:46,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:33:46,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 23:33:46,894 INFO L87 Difference]: Start difference. First operand has 305 states, 243 states have (on average 1.4444444444444444) internal successors, (351), 248 states have internal predecessors, (351), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 23:33:47,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:33:47,636 INFO L93 Difference]: Finished difference Result 947 states and 1418 transitions. [2022-07-19 23:33:47,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 23:33:47,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-07-19 23:33:47,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:33:47,649 INFO L225 Difference]: With dead ends: 947 [2022-07-19 23:33:47,649 INFO L226 Difference]: Without dead ends: 633 [2022-07-19 23:33:47,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:33:47,655 INFO L413 NwaCegarLoop]: 462 mSDtfsCounter, 503 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 23:33:47,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1032 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 23:33:47,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2022-07-19 23:33:47,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 565. [2022-07-19 23:33:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 456 states have (on average 1.4078947368421053) internal successors, (642), 456 states have internal predecessors, (642), 80 states have call successors, (80), 29 states have call predecessors, (80), 28 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-07-19 23:33:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 801 transitions. [2022-07-19 23:33:47,732 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 801 transitions. Word has length 25 [2022-07-19 23:33:47,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:33:47,732 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 801 transitions. [2022-07-19 23:33:47,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 23:33:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 801 transitions. [2022-07-19 23:33:47,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 23:33:47,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:33:47,735 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] [2022-07-19 23:33:47,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 23:33:47,735 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:33:47,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:33:47,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1364109622, now seen corresponding path program 1 times [2022-07-19 23:33:47,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:33:47,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876247423] [2022-07-19 23:33:47,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:33:47,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:33:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:47,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:33:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:47,808 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-19 23:33:47,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:33:47,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876247423] [2022-07-19 23:33:47,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876247423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:33:47,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:33:47,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 23:33:47,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35316422] [2022-07-19 23:33:47,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:33:47,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:33:47,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:33:47,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:33:47,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:33:47,812 INFO L87 Difference]: Start difference. First operand 565 states and 801 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 23:33:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:33:48,609 INFO L93 Difference]: Finished difference Result 1189 states and 1695 transitions. [2022-07-19 23:33:48,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 23:33:48,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-07-19 23:33:48,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:33:48,614 INFO L225 Difference]: With dead ends: 1189 [2022-07-19 23:33:48,614 INFO L226 Difference]: Without dead ends: 632 [2022-07-19 23:33:48,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:33:48,616 INFO L413 NwaCegarLoop]: 620 mSDtfsCounter, 701 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 23:33:48,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1317 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 23:33:48,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2022-07-19 23:33:48,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 564. [2022-07-19 23:33:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 455 states have (on average 1.402197802197802) internal successors, (638), 455 states have internal predecessors, (638), 80 states have call successors, (80), 29 states have call predecessors, (80), 28 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-07-19 23:33:48,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 797 transitions. [2022-07-19 23:33:48,654 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 797 transitions. Word has length 29 [2022-07-19 23:33:48,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:33:48,654 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 797 transitions. [2022-07-19 23:33:48,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 23:33:48,654 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 797 transitions. [2022-07-19 23:33:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 23:33:48,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:33:48,657 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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-19 23:33:48,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 23:33:48,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:33:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:33:48,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2094845703, now seen corresponding path program 1 times [2022-07-19 23:33:48,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:33:48,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833886976] [2022-07-19 23:33:48,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:33:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:33:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:48,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:33:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:48,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 23:33:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:33:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:48,759 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 23:33:48,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:33:48,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833886976] [2022-07-19 23:33:48,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833886976] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:33:48,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:33:48,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 23:33:48,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083880055] [2022-07-19 23:33:48,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:33:48,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:33:48,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:33:48,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:33:48,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:33:48,761 INFO L87 Difference]: Start difference. First operand 564 states and 797 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 23:33:49,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:33:49,500 INFO L93 Difference]: Finished difference Result 1799 states and 2590 transitions. [2022-07-19 23:33:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:33:49,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2022-07-19 23:33:49,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:33:49,513 INFO L225 Difference]: With dead ends: 1799 [2022-07-19 23:33:49,513 INFO L226 Difference]: Without dead ends: 1238 [2022-07-19 23:33:49,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:33:49,515 INFO L413 NwaCegarLoop]: 450 mSDtfsCounter, 491 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 23:33:49,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1756 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 23:33:49,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2022-07-19 23:33:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1138. [2022-07-19 23:33:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 917 states have (on average 1.4034896401308614) internal successors, (1287), 919 states have internal predecessors, (1287), 158 states have call successors, (158), 57 states have call predecessors, (158), 62 states have return successors, (179), 161 states have call predecessors, (179), 157 states have call successors, (179) [2022-07-19 23:33:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1624 transitions. [2022-07-19 23:33:49,567 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1624 transitions. Word has length 50 [2022-07-19 23:33:49,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:33:49,567 INFO L495 AbstractCegarLoop]: Abstraction has 1138 states and 1624 transitions. [2022-07-19 23:33:49,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 23:33:49,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1624 transitions. [2022-07-19 23:33:49,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-19 23:33:49,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:33:49,574 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2022-07-19 23:33:49,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 23:33:49,574 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:33:49,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:33:49,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1094727353, now seen corresponding path program 1 times [2022-07-19 23:33:49,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:33:49,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967484470] [2022-07-19 23:33:49,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:33:49,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:33:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:49,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:33:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:49,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:33:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:49,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:33:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:49,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:33:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:49,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:33:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:49,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 23:33:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:49,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 23:33:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-19 23:33:49,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:33:49,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967484470] [2022-07-19 23:33:49,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967484470] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:33:49,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:33:49,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 23:33:49,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962090847] [2022-07-19 23:33:49,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:33:49,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:33:49,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:33:49,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:33:49,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:33:49,673 INFO L87 Difference]: Start difference. First operand 1138 states and 1624 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 23:33:50,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:33:50,399 INFO L93 Difference]: Finished difference Result 1832 states and 2618 transitions. [2022-07-19 23:33:50,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 23:33:50,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 97 [2022-07-19 23:33:50,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:33:50,402 INFO L225 Difference]: With dead ends: 1832 [2022-07-19 23:33:50,403 INFO L226 Difference]: Without dead ends: 702 [2022-07-19 23:33:50,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:33:50,405 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 112 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 23:33:50,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1111 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 23:33:50,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-07-19 23:33:50,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 642. [2022-07-19 23:33:50,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 523 states have (on average 1.395793499043977) internal successors, (730), 525 states have internal predecessors, (730), 83 states have call successors, (83), 31 states have call predecessors, (83), 35 states have return successors, (97), 85 states have call predecessors, (97), 82 states have call successors, (97) [2022-07-19 23:33:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 910 transitions. [2022-07-19 23:33:50,426 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 910 transitions. Word has length 97 [2022-07-19 23:33:50,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:33:50,427 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 910 transitions. [2022-07-19 23:33:50,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 23:33:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 910 transitions. [2022-07-19 23:33:50,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-19 23:33:50,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:33:50,429 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2022-07-19 23:33:50,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 23:33:50,429 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:33:50,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:33:50,430 INFO L85 PathProgramCache]: Analyzing trace with hash -660311895, now seen corresponding path program 2 times [2022-07-19 23:33:50,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:33:50,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957220926] [2022-07-19 23:33:50,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:33:50,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:33:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:50,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:33:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:50,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 23:33:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:50,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:33:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:50,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:33:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:50,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 23:33:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:50,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:33:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:50,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:33:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 23:33:50,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:33:50,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957220926] [2022-07-19 23:33:50,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957220926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:33:50,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:33:50,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 23:33:50,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535066386] [2022-07-19 23:33:50,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:33:50,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 23:33:50,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:33:50,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 23:33:50,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:33:50,628 INFO L87 Difference]: Start difference. First operand 642 states and 910 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-19 23:33:51,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:33:51,300 INFO L93 Difference]: Finished difference Result 1288 states and 1855 transitions. [2022-07-19 23:33:51,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 23:33:51,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) Word has length 97 [2022-07-19 23:33:51,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:33:51,304 INFO L225 Difference]: With dead ends: 1288 [2022-07-19 23:33:51,304 INFO L226 Difference]: Without dead ends: 678 [2022-07-19 23:33:51,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-19 23:33:51,306 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 98 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 2271 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 23:33:51,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 2271 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 23:33:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-07-19 23:33:51,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 642. [2022-07-19 23:33:51,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 521 states have (on average 1.3896353166986564) internal successors, (724), 524 states have internal predecessors, (724), 83 states have call successors, (83), 31 states have call predecessors, (83), 37 states have return successors, (101), 86 states have call predecessors, (101), 82 states have call successors, (101) [2022-07-19 23:33:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 908 transitions. [2022-07-19 23:33:51,326 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 908 transitions. Word has length 97 [2022-07-19 23:33:51,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:33:51,326 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 908 transitions. [2022-07-19 23:33:51,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-19 23:33:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 908 transitions. [2022-07-19 23:33:51,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-19 23:33:51,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:33:51,328 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-19 23:33:51,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 23:33:51,329 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:33:51,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:33:51,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1628559102, now seen corresponding path program 1 times [2022-07-19 23:33:51,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:33:51,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040801840] [2022-07-19 23:33:51,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:33:51,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:33:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:51,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:33:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:51,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 23:33:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:51,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:33:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:51,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:33:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:51,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:33:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:51,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:33:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:51,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:33:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:51,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:33:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 23:33:51,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:33:51,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040801840] [2022-07-19 23:33:51,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040801840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:33:51,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:33:51,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 23:33:51,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755916875] [2022-07-19 23:33:51,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:33:51,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 23:33:51,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:33:51,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 23:33:51,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 23:33:51,591 INFO L87 Difference]: Start difference. First operand 642 states and 908 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 8 states have internal predecessors, (84), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 23:33:52,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:33:52,465 INFO L93 Difference]: Finished difference Result 1292 states and 1853 transitions. [2022-07-19 23:33:52,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 23:33:52,466 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 8 states have internal predecessors, (84), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) Word has length 109 [2022-07-19 23:33:52,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:33:52,469 INFO L225 Difference]: With dead ends: 1292 [2022-07-19 23:33:52,469 INFO L226 Difference]: Without dead ends: 682 [2022-07-19 23:33:52,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-07-19 23:33:52,471 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 113 mSDsluCounter, 2905 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 23:33:52,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 3309 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 23:33:52,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-07-19 23:33:52,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 646. [2022-07-19 23:33:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 524 states have (on average 1.381679389312977) internal successors, (724), 526 states have internal predecessors, (724), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) [2022-07-19 23:33:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 910 transitions. [2022-07-19 23:33:52,504 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 910 transitions. Word has length 109 [2022-07-19 23:33:52,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:33:52,504 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 910 transitions. [2022-07-19 23:33:52,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 8 states have internal predecessors, (84), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 23:33:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 910 transitions. [2022-07-19 23:33:52,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-19 23:33:52,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:33:52,506 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-19 23:33:52,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 23:33:52,507 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:33:52,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:33:52,507 INFO L85 PathProgramCache]: Analyzing trace with hash -556686604, now seen corresponding path program 1 times [2022-07-19 23:33:52,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:33:52,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687958332] [2022-07-19 23:33:52,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:33:52,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:33:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:52,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:33:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:52,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 23:33:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:52,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:33:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:52,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:33:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:52,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:33:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:52,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:33:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:52,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:33:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:52,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:33:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:52,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:33:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 23:33:52,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:33:52,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687958332] [2022-07-19 23:33:52,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687958332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:33:52,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:33:52,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 23:33:52,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062172245] [2022-07-19 23:33:52,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:33:52,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:33:52,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:33:52,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:33:52,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:33:52,703 INFO L87 Difference]: Start difference. First operand 646 states and 910 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 23:33:53,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:33:53,154 INFO L93 Difference]: Finished difference Result 1347 states and 1922 transitions. [2022-07-19 23:33:53,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 23:33:53,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 115 [2022-07-19 23:33:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:33:53,157 INFO L225 Difference]: With dead ends: 1347 [2022-07-19 23:33:53,157 INFO L226 Difference]: Without dead ends: 719 [2022-07-19 23:33:53,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:33:53,160 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 140 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 23:33:53,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1214 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 23:33:53,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-07-19 23:33:53,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 647. [2022-07-19 23:33:53,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 525 states have (on average 1.380952380952381) internal successors, (725), 527 states have internal predecessors, (725), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) [2022-07-19 23:33:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 911 transitions. [2022-07-19 23:33:53,199 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 911 transitions. Word has length 115 [2022-07-19 23:33:53,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:33:53,199 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 911 transitions. [2022-07-19 23:33:53,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 23:33:53,200 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 911 transitions. [2022-07-19 23:33:53,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-19 23:33:53,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:33:53,201 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-19 23:33:53,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 23:33:53,202 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:33:53,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:33:53,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1428826331, now seen corresponding path program 1 times [2022-07-19 23:33:53,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:33:53,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685708248] [2022-07-19 23:33:53,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:33:53,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:33:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:53,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:33:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:53,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 23:33:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:53,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:33:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:53,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 23:33:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:53,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 23:33:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:53,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:33:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:53,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:33:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:53,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:33:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:53,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:33:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 23:33:53,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:33:53,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685708248] [2022-07-19 23:33:53,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685708248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:33:53,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:33:53,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-19 23:33:53,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586140699] [2022-07-19 23:33:53,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:33:53,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 23:33:53,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:33:53,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 23:33:53,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-07-19 23:33:53,763 INFO L87 Difference]: Start difference. First operand 647 states and 911 transitions. Second operand has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 23:33:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:33:55,591 INFO L93 Difference]: Finished difference Result 1567 states and 2276 transitions. [2022-07-19 23:33:55,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 23:33:55,592 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) Word has length 111 [2022-07-19 23:33:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:33:55,596 INFO L225 Difference]: With dead ends: 1567 [2022-07-19 23:33:55,596 INFO L226 Difference]: Without dead ends: 953 [2022-07-19 23:33:55,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-07-19 23:33:55,598 INFO L413 NwaCegarLoop]: 554 mSDtfsCounter, 237 mSDsluCounter, 7463 mSDsCounter, 0 mSdLazyCounter, 2114 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 8017 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-19 23:33:55,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 8017 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2114 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-19 23:33:55,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-07-19 23:33:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 656. [2022-07-19 23:33:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 532 states have (on average 1.3759398496240602) internal successors, (732), 533 states have internal predecessors, (732), 85 states have call successors, (85), 31 states have call predecessors, (85), 38 states have return successors, (105), 91 states have call predecessors, (105), 84 states have call successors, (105) [2022-07-19 23:33:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 922 transitions. [2022-07-19 23:33:55,628 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 922 transitions. Word has length 111 [2022-07-19 23:33:55,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:33:55,629 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 922 transitions. [2022-07-19 23:33:55,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 23:33:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 922 transitions. [2022-07-19 23:33:55,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-19 23:33:55,631 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:33:55,632 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-19 23:33:55,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 23:33:55,632 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:33:55,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:33:55,633 INFO L85 PathProgramCache]: Analyzing trace with hash -363635253, now seen corresponding path program 1 times [2022-07-19 23:33:55,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:33:55,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954909528] [2022-07-19 23:33:55,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:33:55,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:33:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:55,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:33:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:55,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 23:33:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:55,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:33:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:55,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 23:33:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:55,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 23:33:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:55,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:33:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:55,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:33:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:55,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:33:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:55,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:33:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 23:33:55,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:33:55,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954909528] [2022-07-19 23:33:55,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954909528] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:33:55,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:33:55,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 23:33:55,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556312261] [2022-07-19 23:33:55,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:33:55,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 23:33:55,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:33:55,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 23:33:55,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:33:55,856 INFO L87 Difference]: Start difference. First operand 656 states and 922 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 23:33:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:33:57,215 INFO L93 Difference]: Finished difference Result 1520 states and 2195 transitions. [2022-07-19 23:33:57,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 23:33:57,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 116 [2022-07-19 23:33:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:33:57,219 INFO L225 Difference]: With dead ends: 1520 [2022-07-19 23:33:57,219 INFO L226 Difference]: Without dead ends: 897 [2022-07-19 23:33:57,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:33:57,221 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 186 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-19 23:33:57,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1911 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-19 23:33:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-07-19 23:33:57,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 664. [2022-07-19 23:33:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 540 states have (on average 1.3777777777777778) internal successors, (744), 541 states have internal predecessors, (744), 85 states have call successors, (85), 31 states have call predecessors, (85), 38 states have return successors, (105), 91 states have call predecessors, (105), 84 states have call successors, (105) [2022-07-19 23:33:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 934 transitions. [2022-07-19 23:33:57,247 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 934 transitions. Word has length 116 [2022-07-19 23:33:57,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:33:57,248 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 934 transitions. [2022-07-19 23:33:57,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 23:33:57,248 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 934 transitions. [2022-07-19 23:33:57,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-19 23:33:57,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:33:57,250 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-19 23:33:57,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 23:33:57,250 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:33:57,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:33:57,250 INFO L85 PathProgramCache]: Analyzing trace with hash -161811319, now seen corresponding path program 1 times [2022-07-19 23:33:57,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:33:57,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725563702] [2022-07-19 23:33:57,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:33:57,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:33:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:57,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:33:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:57,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 23:33:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:57,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:33:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:57,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 23:33:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:57,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 23:33:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:57,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:33:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:57,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:33:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:57,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:33:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:57,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:33:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 23:33:57,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:33:57,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725563702] [2022-07-19 23:33:57,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725563702] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:33:57,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:33:57,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-19 23:33:57,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863408377] [2022-07-19 23:33:57,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:33:57,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 23:33:57,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:33:57,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 23:33:57,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-07-19 23:33:57,755 INFO L87 Difference]: Start difference. First operand 664 states and 934 transitions. Second operand has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 12 states have internal predecessors, (89), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 23:33:58,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:33:58,858 INFO L93 Difference]: Finished difference Result 1386 states and 1981 transitions. [2022-07-19 23:33:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 23:33:58,859 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 12 states have internal predecessors, (89), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) Word has length 116 [2022-07-19 23:33:58,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:33:58,861 INFO L225 Difference]: With dead ends: 1386 [2022-07-19 23:33:58,861 INFO L226 Difference]: Without dead ends: 755 [2022-07-19 23:33:58,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-07-19 23:33:58,863 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 214 mSDsluCounter, 4727 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 5139 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 23:33:58,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 5139 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 23:33:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2022-07-19 23:33:58,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 668. [2022-07-19 23:33:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 544 states have (on average 1.375) internal successors, (748), 543 states have internal predecessors, (748), 85 states have call successors, (85), 31 states have call predecessors, (85), 38 states have return successors, (105), 93 states have call predecessors, (105), 84 states have call successors, (105) [2022-07-19 23:33:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 938 transitions. [2022-07-19 23:33:58,902 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 938 transitions. Word has length 116 [2022-07-19 23:33:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:33:58,902 INFO L495 AbstractCegarLoop]: Abstraction has 668 states and 938 transitions. [2022-07-19 23:33:58,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 12 states have internal predecessors, (89), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 23:33:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 938 transitions. [2022-07-19 23:33:58,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-19 23:33:58,904 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:33:58,904 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-19 23:33:58,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 23:33:58,905 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:33:58,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:33:58,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1915934418, now seen corresponding path program 1 times [2022-07-19 23:33:58,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:33:58,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146294503] [2022-07-19 23:33:58,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:33:58,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:33:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:58,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:33:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:58,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 23:33:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:58,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:33:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:58,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 23:33:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:58,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 23:33:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:58,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:33:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:58,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:33:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:59,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:33:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:59,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 23:33:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:59,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:33:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:59,041 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 23:33:59,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:33:59,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146294503] [2022-07-19 23:33:59,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146294503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:33:59,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:33:59,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 23:33:59,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792158163] [2022-07-19 23:33:59,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:33:59,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 23:33:59,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:33:59,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 23:33:59,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:33:59,044 INFO L87 Difference]: Start difference. First operand 668 states and 938 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 23:33:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:33:59,756 INFO L93 Difference]: Finished difference Result 1067 states and 1523 transitions. [2022-07-19 23:33:59,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:33:59,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 121 [2022-07-19 23:33:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:33:59,759 INFO L225 Difference]: With dead ends: 1067 [2022-07-19 23:33:59,759 INFO L226 Difference]: Without dead ends: 741 [2022-07-19 23:33:59,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-19 23:33:59,760 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 202 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 23:33:59,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1400 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 23:33:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-07-19 23:33:59,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 670. [2022-07-19 23:33:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 546 states have (on average 1.3736263736263736) internal successors, (750), 545 states have internal predecessors, (750), 85 states have call successors, (85), 31 states have call predecessors, (85), 38 states have return successors, (105), 93 states have call predecessors, (105), 84 states have call successors, (105) [2022-07-19 23:33:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 940 transitions. [2022-07-19 23:33:59,783 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 940 transitions. Word has length 121 [2022-07-19 23:33:59,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:33:59,783 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 940 transitions. [2022-07-19 23:33:59,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 23:33:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 940 transitions. [2022-07-19 23:33:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-19 23:33:59,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:33:59,785 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-07-19 23:33:59,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 23:33:59,785 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:33:59,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:33:59,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1115994769, now seen corresponding path program 1 times [2022-07-19 23:33:59,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:33:59,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588371311] [2022-07-19 23:33:59,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:33:59,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:33:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:59,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:33:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:59,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 23:33:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:59,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:33:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:59,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 23:33:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:59,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 23:33:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:59,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:33:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:59,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:33:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:59,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:33:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:59,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 23:33:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:59,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:33:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:33:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 23:33:59,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:33:59,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588371311] [2022-07-19 23:33:59,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588371311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:33:59,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:33:59,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 23:33:59,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567089183] [2022-07-19 23:33:59,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:33:59,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 23:33:59,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:33:59,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 23:33:59,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-19 23:33:59,990 INFO L87 Difference]: Start difference. First operand 670 states and 940 transitions. Second operand has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 7 states have internal predecessors, (95), 4 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 23:34:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:34:01,304 INFO L93 Difference]: Finished difference Result 1415 states and 2001 transitions. [2022-07-19 23:34:01,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 23:34:01,304 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 7 states have internal predecessors, (95), 4 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 123 [2022-07-19 23:34:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:34:01,307 INFO L225 Difference]: With dead ends: 1415 [2022-07-19 23:34:01,307 INFO L226 Difference]: Without dead ends: 778 [2022-07-19 23:34:01,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2022-07-19 23:34:01,309 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 989 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:34:01,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1646 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-19 23:34:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-07-19 23:34:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 688. [2022-07-19 23:34:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 558 states have (on average 1.3620071684587813) internal successors, (760), 558 states have internal predecessors, (760), 88 states have call successors, (88), 33 states have call predecessors, (88), 41 states have return successors, (106), 96 states have call predecessors, (106), 87 states have call successors, (106) [2022-07-19 23:34:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 954 transitions. [2022-07-19 23:34:01,333 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 954 transitions. Word has length 123 [2022-07-19 23:34:01,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:34:01,334 INFO L495 AbstractCegarLoop]: Abstraction has 688 states and 954 transitions. [2022-07-19 23:34:01,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 7 states have internal predecessors, (95), 4 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 23:34:01,334 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 954 transitions. [2022-07-19 23:34:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-19 23:34:01,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:34:01,336 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-19 23:34:01,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 23:34:01,336 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:34:01,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:34:01,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1527207652, now seen corresponding path program 1 times [2022-07-19 23:34:01,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:34:01,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115742926] [2022-07-19 23:34:01,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:34:01,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:34:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:01,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:34:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:01,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 23:34:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:01,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:34:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:01,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 23:34:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:01,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 23:34:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:01,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:34:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:01,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:34:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:01,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:34:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:01,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:34:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:01,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 23:34:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:01,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 23:34:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:01,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 23:34:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:01,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 23:34:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 23:34:01,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:34:01,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115742926] [2022-07-19 23:34:01,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115742926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:34:01,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:34:01,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 23:34:01,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30611122] [2022-07-19 23:34:01,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:34:01,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:34:01,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:34:01,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:34:01,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:34:01,504 INFO L87 Difference]: Start difference. First operand 688 states and 954 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-19 23:34:02,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:34:02,337 INFO L93 Difference]: Finished difference Result 1617 states and 2297 transitions. [2022-07-19 23:34:02,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:34:02,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 139 [2022-07-19 23:34:02,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:34:02,342 INFO L225 Difference]: With dead ends: 1617 [2022-07-19 23:34:02,342 INFO L226 Difference]: Without dead ends: 962 [2022-07-19 23:34:02,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:34:02,344 INFO L413 NwaCegarLoop]: 516 mSDtfsCounter, 306 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 23:34:02,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1789 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 23:34:02,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-07-19 23:34:02,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 684. [2022-07-19 23:34:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 556 states have (on average 1.3597122302158273) internal successors, (756), 556 states have internal predecessors, (756), 86 states have call successors, (86), 33 states have call predecessors, (86), 41 states have return successors, (104), 94 states have call predecessors, (104), 85 states have call successors, (104) [2022-07-19 23:34:02,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 946 transitions. [2022-07-19 23:34:02,368 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 946 transitions. Word has length 139 [2022-07-19 23:34:02,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:34:02,369 INFO L495 AbstractCegarLoop]: Abstraction has 684 states and 946 transitions. [2022-07-19 23:34:02,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-19 23:34:02,369 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 946 transitions. [2022-07-19 23:34:02,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-19 23:34:02,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:34:02,371 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-19 23:34:02,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 23:34:02,371 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:34:02,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:34:02,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1475201316, now seen corresponding path program 1 times [2022-07-19 23:34:02,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:34:02,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104562408] [2022-07-19 23:34:02,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:34:02,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:34:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:02,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:34:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:02,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 23:34:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:02,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:34:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:02,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 23:34:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:02,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 23:34:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:02,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:34:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:02,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:34:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:02,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:34:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:02,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:34:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:02,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 23:34:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:02,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 23:34:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:02,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 23:34:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:02,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 23:34:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 23:34:02,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:34:02,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104562408] [2022-07-19 23:34:02,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104562408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:34:02,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:34:02,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 23:34:02,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142094932] [2022-07-19 23:34:02,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:34:02,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 23:34:02,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:34:02,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 23:34:02,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:34:02,602 INFO L87 Difference]: Start difference. First operand 684 states and 946 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-19 23:34:03,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:34:03,582 INFO L93 Difference]: Finished difference Result 1619 states and 2299 transitions. [2022-07-19 23:34:03,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 23:34:03,584 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 139 [2022-07-19 23:34:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:34:03,604 INFO L225 Difference]: With dead ends: 1619 [2022-07-19 23:34:03,604 INFO L226 Difference]: Without dead ends: 968 [2022-07-19 23:34:03,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-19 23:34:03,608 INFO L413 NwaCegarLoop]: 512 mSDtfsCounter, 224 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 2647 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 23:34:03,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 2647 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 23:34:03,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2022-07-19 23:34:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 692. [2022-07-19 23:34:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 562 states have (on average 1.3629893238434163) internal successors, (766), 564 states have internal predecessors, (766), 86 states have call successors, (86), 33 states have call predecessors, (86), 43 states have return successors, (108), 94 states have call predecessors, (108), 85 states have call successors, (108) [2022-07-19 23:34:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 960 transitions. [2022-07-19 23:34:03,636 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 960 transitions. Word has length 139 [2022-07-19 23:34:03,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:34:03,636 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 960 transitions. [2022-07-19 23:34:03,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-19 23:34:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 960 transitions. [2022-07-19 23:34:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-19 23:34:03,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:34:03,639 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-19 23:34:03,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 23:34:03,639 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:34:03,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:34:03,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1269181933, now seen corresponding path program 1 times [2022-07-19 23:34:03,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:34:03,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002760947] [2022-07-19 23:34:03,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:34:03,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:34:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:03,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:34:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:03,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 23:34:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:03,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:34:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:03,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 23:34:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:03,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 23:34:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:03,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:34:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:03,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:34:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:03,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:34:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:03,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:34:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:03,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 23:34:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:03,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:34:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:03,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 23:34:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:03,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 23:34:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:03,877 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 23:34:03,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:34:03,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002760947] [2022-07-19 23:34:03,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002760947] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:34:03,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417289550] [2022-07-19 23:34:03,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:34:03,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:34:03,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:34:03,886 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-19 23:34:03,888 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-19 23:34:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:04,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 23:34:04,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:34:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 23:34:04,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:34:04,445 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 23:34:04,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417289550] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 23:34:04,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 23:34:04,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 5] total 11 [2022-07-19 23:34:04,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657788184] [2022-07-19 23:34:04,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:34:04,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:34:04,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:34:04,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:34:04,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-19 23:34:04,456 INFO L87 Difference]: Start difference. First operand 692 states and 960 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-19 23:34:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:34:04,542 INFO L93 Difference]: Finished difference Result 1359 states and 1901 transitions. [2022-07-19 23:34:04,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 23:34:04,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 140 [2022-07-19 23:34:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:34:04,546 INFO L225 Difference]: With dead ends: 1359 [2022-07-19 23:34:04,546 INFO L226 Difference]: Without dead ends: 700 [2022-07-19 23:34:04,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-19 23:34:04,549 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 3 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:34:04,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 815 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 23:34:04,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-07-19 23:34:04,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 694. [2022-07-19 23:34:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 564 states have (on average 1.3617021276595744) internal successors, (768), 566 states have internal predecessors, (768), 86 states have call successors, (86), 33 states have call predecessors, (86), 43 states have return successors, (108), 94 states have call predecessors, (108), 85 states have call successors, (108) [2022-07-19 23:34:04,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 962 transitions. [2022-07-19 23:34:04,578 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 962 transitions. Word has length 140 [2022-07-19 23:34:04,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:34:04,578 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 962 transitions. [2022-07-19 23:34:04,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-19 23:34:04,579 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 962 transitions. [2022-07-19 23:34:04,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-19 23:34:04,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:34:04,580 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-19 23:34:04,618 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-19 23:34:04,799 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,SelfDestructingSolverStorable14 [2022-07-19 23:34:04,800 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:34:04,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:34:04,800 INFO L85 PathProgramCache]: Analyzing trace with hash 316514682, now seen corresponding path program 1 times [2022-07-19 23:34:04,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:34:04,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300748488] [2022-07-19 23:34:04,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:34:04,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:34:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:04,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:34:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:04,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 23:34:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:04,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:34:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:04,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 23:34:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:04,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 23:34:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:04,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:34:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:04,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:34:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:04,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:34:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:04,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:34:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:04,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 23:34:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:05,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 23:34:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:05,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 23:34:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:05,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 23:34:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:05,064 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 23:34:05,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:34:05,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300748488] [2022-07-19 23:34:05,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300748488] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:34:05,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135175447] [2022-07-19 23:34:05,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:34:05,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:34:05,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:34:05,066 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-19 23:34:05,068 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-19 23:34:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:05,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 23:34:05,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:34:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 23:34:05,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:34:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 23:34:05,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135175447] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 23:34:05,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 23:34:05,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 15 [2022-07-19 23:34:05,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622180542] [2022-07-19 23:34:05,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 23:34:05,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 23:34:05,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:34:05,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 23:34:05,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-19 23:34:05,806 INFO L87 Difference]: Start difference. First operand 694 states and 962 transitions. Second operand has 15 states, 15 states have (on average 8.2) internal successors, (123), 11 states have internal predecessors, (123), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-19 23:34:07,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:34:07,120 INFO L93 Difference]: Finished difference Result 1641 states and 2331 transitions. [2022-07-19 23:34:07,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 23:34:07,120 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.2) internal successors, (123), 11 states have internal predecessors, (123), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 141 [2022-07-19 23:34:07,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:34:07,124 INFO L225 Difference]: With dead ends: 1641 [2022-07-19 23:34:07,124 INFO L226 Difference]: Without dead ends: 980 [2022-07-19 23:34:07,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-07-19 23:34:07,126 INFO L413 NwaCegarLoop]: 514 mSDtfsCounter, 398 mSDsluCounter, 3538 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 4052 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:34:07,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 4052 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-19 23:34:07,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2022-07-19 23:34:07,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 698. [2022-07-19 23:34:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 568 states have (on average 1.3626760563380282) internal successors, (774), 570 states have internal predecessors, (774), 86 states have call successors, (86), 33 states have call predecessors, (86), 43 states have return successors, (108), 94 states have call predecessors, (108), 85 states have call successors, (108) [2022-07-19 23:34:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 968 transitions. [2022-07-19 23:34:07,157 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 968 transitions. Word has length 141 [2022-07-19 23:34:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:34:07,157 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 968 transitions. [2022-07-19 23:34:07,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.2) internal successors, (123), 11 states have internal predecessors, (123), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-19 23:34:07,158 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 968 transitions. [2022-07-19 23:34:07,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-19 23:34:07,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:34:07,160 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-19 23:34:07,185 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-19 23:34:07,380 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,SelfDestructingSolverStorable15 [2022-07-19 23:34:07,381 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:34:07,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:34:07,381 INFO L85 PathProgramCache]: Analyzing trace with hash 558897227, now seen corresponding path program 2 times [2022-07-19 23:34:07,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:34:07,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794011644] [2022-07-19 23:34:07,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:34:07,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:34:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:07,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:34:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:07,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 23:34:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:07,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:34:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:07,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 23:34:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:07,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 23:34:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:07,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:34:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:07,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:34:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:07,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:34:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:07,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:34:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:07,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 23:34:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:07,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 23:34:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:07,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 23:34:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:07,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 23:34:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 23:34:07,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:34:07,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794011644] [2022-07-19 23:34:07,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794011644] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:34:07,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231242572] [2022-07-19 23:34:07,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 23:34:07,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:34:07,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:34:07,707 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-19 23:34:07,708 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-19 23:34:08,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 23:34:08,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 23:34:08,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 23:34:08,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:34:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 23:34:08,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:34:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 23:34:08,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231242572] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 23:34:08,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 23:34:08,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 18 [2022-07-19 23:34:08,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586629002] [2022-07-19 23:34:08,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 23:34:08,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 23:34:08,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:34:08,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 23:34:08,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-07-19 23:34:08,860 INFO L87 Difference]: Start difference. First operand 698 states and 968 transitions. Second operand has 18 states, 18 states have (on average 7.0) internal successors, (126), 14 states have internal predecessors, (126), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-19 23:34:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:34:10,568 INFO L93 Difference]: Finished difference Result 1655 states and 2353 transitions. [2022-07-19 23:34:10,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 23:34:10,569 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.0) internal successors, (126), 14 states have internal predecessors, (126), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 142 [2022-07-19 23:34:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:34:10,572 INFO L225 Difference]: With dead ends: 1655 [2022-07-19 23:34:10,572 INFO L226 Difference]: Without dead ends: 990 [2022-07-19 23:34:10,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2022-07-19 23:34:10,574 INFO L413 NwaCegarLoop]: 514 mSDtfsCounter, 378 mSDsluCounter, 4418 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 4932 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-19 23:34:10,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 4932 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-19 23:34:10,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2022-07-19 23:34:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 700. [2022-07-19 23:34:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 570 states have (on average 1.3649122807017544) internal successors, (778), 572 states have internal predecessors, (778), 86 states have call successors, (86), 33 states have call predecessors, (86), 43 states have return successors, (108), 94 states have call predecessors, (108), 85 states have call successors, (108) [2022-07-19 23:34:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 972 transitions. [2022-07-19 23:34:10,605 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 972 transitions. Word has length 142 [2022-07-19 23:34:10,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:34:10,605 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 972 transitions. [2022-07-19 23:34:10,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.0) internal successors, (126), 14 states have internal predecessors, (126), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-19 23:34:10,606 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 972 transitions. [2022-07-19 23:34:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-19 23:34:10,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:34:10,607 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-07-19 23:34:10,649 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-19 23:34:10,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:34:10,823 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:34:10,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:34:10,824 INFO L85 PathProgramCache]: Analyzing trace with hash -517178470, now seen corresponding path program 3 times [2022-07-19 23:34:10,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:34:10,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388399967] [2022-07-19 23:34:10,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:34:10,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:34:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:11,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:34:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:11,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 23:34:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:11,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:34:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:11,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 23:34:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:11,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 23:34:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:11,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:34:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:11,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:34:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:11,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:34:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:11,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:34:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:11,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 23:34:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:11,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 23:34:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:11,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 23:34:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:11,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-19 23:34:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 23:34:11,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:34:11,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388399967] [2022-07-19 23:34:11,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388399967] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:34:11,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482316518] [2022-07-19 23:34:11,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 23:34:11,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:34:11,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:34:11,292 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-19 23:34:11,302 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-19 23:34:21,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 23:34:21,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 23:34:21,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-19 23:34:21,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:34:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 23:34:21,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:34:21,582 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 23:34:21,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482316518] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 23:34:21,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 23:34:21,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 21 [2022-07-19 23:34:21,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677565489] [2022-07-19 23:34:21,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 23:34:21,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-19 23:34:21,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:34:21,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-19 23:34:21,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-07-19 23:34:21,584 INFO L87 Difference]: Start difference. First operand 700 states and 972 transitions. Second operand has 21 states, 21 states have (on average 6.142857142857143) internal successors, (129), 17 states have internal predecessors, (129), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-19 23:34:24,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:34:24,034 INFO L93 Difference]: Finished difference Result 1667 states and 2373 transitions. [2022-07-19 23:34:24,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 23:34:24,035 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.142857142857143) internal successors, (129), 17 states have internal predecessors, (129), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 143 [2022-07-19 23:34:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:34:24,038 INFO L225 Difference]: With dead ends: 1667 [2022-07-19 23:34:24,038 INFO L226 Difference]: Without dead ends: 1000 [2022-07-19 23:34:24,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 295 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2022-07-19 23:34:24,040 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 322 mSDsluCounter, 4488 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 5003 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:34:24,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 5003 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 23:34:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-07-19 23:34:24,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 702. [2022-07-19 23:34:24,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 572 states have (on average 1.367132867132867) internal successors, (782), 574 states have internal predecessors, (782), 86 states have call successors, (86), 33 states have call predecessors, (86), 43 states have return successors, (108), 94 states have call predecessors, (108), 85 states have call successors, (108) [2022-07-19 23:34:24,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 976 transitions. [2022-07-19 23:34:24,095 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 976 transitions. Word has length 143 [2022-07-19 23:34:24,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:34:24,096 INFO L495 AbstractCegarLoop]: Abstraction has 702 states and 976 transitions. [2022-07-19 23:34:24,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.142857142857143) internal successors, (129), 17 states have internal predecessors, (129), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-19 23:34:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 976 transitions. [2022-07-19 23:34:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-19 23:34:24,098 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:34:24,098 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2022-07-19 23:34:24,121 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-19 23:34:24,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-19 23:34:24,311 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:34:24,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:34:24,311 INFO L85 PathProgramCache]: Analyzing trace with hash 484213291, now seen corresponding path program 4 times [2022-07-19 23:34:24,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:34:24,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280570305] [2022-07-19 23:34:24,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:34:24,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:34:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:24,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:34:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:24,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 23:34:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:24,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:34:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:24,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 23:34:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:24,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 23:34:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:24,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:34:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:24,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:34:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:24,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:34:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:24,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:34:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:24,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 23:34:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:24,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 23:34:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:24,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 23:34:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:24,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 23:34:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 23:34:24,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:34:24,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280570305] [2022-07-19 23:34:24,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280570305] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:34:24,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179210885] [2022-07-19 23:34:24,766 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 23:34:24,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:34:24,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:34:24,788 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-19 23:34:24,789 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-19 23:34:26,991 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 23:34:26,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 23:34:27,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 23:34:27,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:34:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 23:34:27,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:34:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 23:34:27,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179210885] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 23:34:27,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 23:34:27,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 24 [2022-07-19 23:34:27,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942818177] [2022-07-19 23:34:27,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 23:34:27,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 23:34:27,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:34:27,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 23:34:27,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2022-07-19 23:34:27,761 INFO L87 Difference]: Start difference. First operand 702 states and 976 transitions. Second operand has 24 states, 24 states have (on average 5.5) internal successors, (132), 20 states have internal predecessors, (132), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-19 23:34:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:34:30,808 INFO L93 Difference]: Finished difference Result 1681 states and 2397 transitions. [2022-07-19 23:34:30,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 23:34:30,809 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.5) internal successors, (132), 20 states have internal predecessors, (132), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2022-07-19 23:34:30,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:34:30,812 INFO L225 Difference]: With dead ends: 1681 [2022-07-19 23:34:30,812 INFO L226 Difference]: Without dead ends: 1012 [2022-07-19 23:34:30,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 295 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=213, Invalid=1193, Unknown=0, NotChecked=0, Total=1406 [2022-07-19 23:34:30,815 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 476 mSDsluCounter, 5744 mSDsCounter, 0 mSdLazyCounter, 1826 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 6259 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 23:34:30,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 6259 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1826 Invalid, 0 Unknown, 3 Unchecked, 2.2s Time] [2022-07-19 23:34:30,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2022-07-19 23:34:30,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 704. [2022-07-19 23:34:30,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 574 states have (on average 1.3693379790940767) internal successors, (786), 576 states have internal predecessors, (786), 86 states have call successors, (86), 33 states have call predecessors, (86), 43 states have return successors, (108), 94 states have call predecessors, (108), 85 states have call successors, (108) [2022-07-19 23:34:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 980 transitions. [2022-07-19 23:34:30,847 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 980 transitions. Word has length 144 [2022-07-19 23:34:30,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:34:30,848 INFO L495 AbstractCegarLoop]: Abstraction has 704 states and 980 transitions. [2022-07-19 23:34:30,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.5) internal successors, (132), 20 states have internal predecessors, (132), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-19 23:34:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 980 transitions. [2022-07-19 23:34:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-19 23:34:30,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:34:30,850 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 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] [2022-07-19 23:34:30,880 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-19 23:34:31,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:34:31,071 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:34:31,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:34:31,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1462586810, now seen corresponding path program 5 times [2022-07-19 23:34:31,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:34:31,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941421651] [2022-07-19 23:34:31,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:34:31,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:34:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:31,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:34:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:31,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 23:34:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:31,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:34:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:31,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 23:34:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:31,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 23:34:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:31,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:34:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:31,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:34:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:31,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:34:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:31,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:34:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:31,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 23:34:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:31,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 23:34:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:31,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 23:34:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:31,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 23:34:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:34:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 23:34:31,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:34:31,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941421651] [2022-07-19 23:34:31,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941421651] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:34:31,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660745952] [2022-07-19 23:34:31,462 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 23:34:31,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:34:31,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:34:31,463 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-19 23:34:31,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process