./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 00:49:27,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 00:49:27,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 00:49:27,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 00:49:27,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 00:49:27,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 00:49:27,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 00:49:27,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 00:49:27,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 00:49:27,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 00:49:27,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 00:49:27,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 00:49:27,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 00:49:27,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 00:49:27,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 00:49:27,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 00:49:27,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 00:49:27,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 00:49:27,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 00:49:27,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 00:49:27,505 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 00:49:27,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 00:49:27,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 00:49:27,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 00:49:27,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 00:49:27,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 00:49:27,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 00:49:27,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 00:49:27,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 00:49:27,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 00:49:27,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 00:49:27,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 00:49:27,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 00:49:27,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 00:49:27,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 00:49:27,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 00:49:27,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 00:49:27,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 00:49:27,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 00:49:27,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 00:49:27,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 00:49:27,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 00:49:27,523 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 00:49:27,548 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 00:49:27,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 00:49:27,548 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 00:49:27,549 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 00:49:27,549 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 00:49:27,549 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 00:49:27,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 00:49:27,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 00:49:27,550 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 00:49:27,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 00:49:27,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 00:49:27,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 00:49:27,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 00:49:27,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 00:49:27,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 00:49:27,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 00:49:27,552 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 00:49:27,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 00:49:27,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 00:49:27,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 00:49:27,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 00:49:27,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:49:27,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 00:49:27,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 00:49:27,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 00:49:27,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 00:49:27,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 00:49:27,554 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 00:49:27,555 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 00:49:27,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 00:49:27,555 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 -> 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b [2022-07-14 00:49:27,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 00:49:27,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 00:49:27,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 00:49:27,792 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 00:49:27,793 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 00:49:27,794 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-14 00:49:27,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e9e0f74/8fa352dc8f234203b84b2f77b8e01700/FLAGb3b1fa417 [2022-07-14 00:49:28,342 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 00:49:28,342 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-14 00:49:28,379 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e9e0f74/8fa352dc8f234203b84b2f77b8e01700/FLAGb3b1fa417 [2022-07-14 00:49:28,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e9e0f74/8fa352dc8f234203b84b2f77b8e01700 [2022-07-14 00:49:28,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 00:49:28,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 00:49:28,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 00:49:28,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 00:49:28,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 00:49:28,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:49:28" (1/1) ... [2022-07-14 00:49:28,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c841402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:28, skipping insertion in model container [2022-07-14 00:49:28,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:49:28" (1/1) ... [2022-07-14 00:49:28,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 00:49:28,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 00:49:29,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-07-14 00:49:29,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:49:29,546 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 00:49:29,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-07-14 00:49:29,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:49:29,725 INFO L208 MainTranslator]: Completed translation [2022-07-14 00:49:29,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:29 WrapperNode [2022-07-14 00:49:29,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 00:49:29,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 00:49:29,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 00:49:29,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 00:49:29,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:29" (1/1) ... [2022-07-14 00:49:29,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:29" (1/1) ... [2022-07-14 00:49:29,794 INFO L137 Inliner]: procedures = 109, calls = 313, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 781 [2022-07-14 00:49:29,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 00:49:29,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 00:49:29,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 00:49:29,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 00:49:29,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:29" (1/1) ... [2022-07-14 00:49:29,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:29" (1/1) ... [2022-07-14 00:49:29,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:29" (1/1) ... [2022-07-14 00:49:29,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:29" (1/1) ... [2022-07-14 00:49:29,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:29" (1/1) ... [2022-07-14 00:49:29,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:29" (1/1) ... [2022-07-14 00:49:29,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:29" (1/1) ... [2022-07-14 00:49:29,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 00:49:29,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 00:49:29,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 00:49:29,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 00:49:29,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:29" (1/1) ... [2022-07-14 00:49:29,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:49:29,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:49:29,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 00:49:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 00:49:29,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 00:49:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 00:49:29,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 00:49:29,886 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 00:49:29,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 00:49:29,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 00:49:29,886 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 00:49:29,886 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 00:49:29,886 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-07-14 00:49:29,886 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-07-14 00:49:29,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 00:49:29,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 00:49:29,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-14 00:49:29,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-14 00:49:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 00:49:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 00:49:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-07-14 00:49:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-07-14 00:49:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-14 00:49:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-14 00:49:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 00:49:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 00:49:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 00:49:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 00:49:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 00:49:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 00:49:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 00:49:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-14 00:49:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-14 00:49:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-14 00:49:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-14 00:49:29,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-07-14 00:49:29,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-07-14 00:49:29,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 00:49:29,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 00:49:29,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 00:49:29,902 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-14 00:49:29,902 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-14 00:49:29,902 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-14 00:49:29,902 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-14 00:49:29,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 00:49:29,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 00:49:29,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 00:49:30,121 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 00:49:30,123 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 00:49:30,256 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 00:49:30,703 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 00:49:30,709 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 00:49:30,709 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 00:49:30,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:49:30 BoogieIcfgContainer [2022-07-14 00:49:30,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 00:49:30,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 00:49:30,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 00:49:30,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 00:49:30,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:49:28" (1/3) ... [2022-07-14 00:49:30,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3319497c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:49:30, skipping insertion in model container [2022-07-14 00:49:30,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:29" (2/3) ... [2022-07-14 00:49:30,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3319497c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:49:30, skipping insertion in model container [2022-07-14 00:49:30,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:49:30" (3/3) ... [2022-07-14 00:49:30,716 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-14 00:49:30,725 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 00:49:30,725 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-14 00:49:30,760 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 00:49:30,764 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@453391c8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3654bede [2022-07-14 00:49:30,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-14 00:49:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 177 states have (on average 1.3276836158192091) internal successors, (235), 188 states have internal predecessors, (235), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-07-14 00:49:30,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 00:49:30,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:30,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:30,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:30,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:30,779 INFO L85 PathProgramCache]: Analyzing trace with hash -949146533, now seen corresponding path program 1 times [2022-07-14 00:49:30,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:30,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058485931] [2022-07-14 00:49:30,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:30,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:31,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:31,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:31,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:31,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 00:49:31,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:31,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058485931] [2022-07-14 00:49:31,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058485931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:31,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:31,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 00:49:31,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204288797] [2022-07-14 00:49:31,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:31,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:49:31,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:31,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:49:31,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 00:49:31,121 INFO L87 Difference]: Start difference. First operand has 237 states, 177 states have (on average 1.3276836158192091) internal successors, (235), 188 states have internal predecessors, (235), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 00:49:31,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:31,394 INFO L93 Difference]: Finished difference Result 476 states and 652 transitions. [2022-07-14 00:49:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:49:31,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-07-14 00:49:31,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:31,404 INFO L225 Difference]: With dead ends: 476 [2022-07-14 00:49:31,404 INFO L226 Difference]: Without dead ends: 233 [2022-07-14 00:49:31,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 00:49:31,409 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 90 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:31,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 468 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 00:49:31,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-14 00:49:31,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 226. [2022-07-14 00:49:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 172 states have (on average 1.2848837209302326) internal successors, (221), 177 states have internal predecessors, (221), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-14 00:49:31,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 295 transitions. [2022-07-14 00:49:31,450 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 295 transitions. Word has length 32 [2022-07-14 00:49:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:31,450 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 295 transitions. [2022-07-14 00:49:31,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 00:49:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 295 transitions. [2022-07-14 00:49:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 00:49:31,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:31,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:31,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 00:49:31,455 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:31,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:31,458 INFO L85 PathProgramCache]: Analyzing trace with hash -526444707, now seen corresponding path program 1 times [2022-07-14 00:49:31,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:31,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311612898] [2022-07-14 00:49:31,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:31,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:31,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:31,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:31,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 00:49:31,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:31,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311612898] [2022-07-14 00:49:31,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311612898] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:31,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:31,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:49:31,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417545603] [2022-07-14 00:49:31,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:31,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:49:31,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:31,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:49:31,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:49:31,568 INFO L87 Difference]: Start difference. First operand 226 states and 295 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 00:49:32,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:32,036 INFO L93 Difference]: Finished difference Result 658 states and 868 transitions. [2022-07-14 00:49:32,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:49:32,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-07-14 00:49:32,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:32,042 INFO L225 Difference]: With dead ends: 658 [2022-07-14 00:49:32,042 INFO L226 Difference]: Without dead ends: 437 [2022-07-14 00:49:32,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:49:32,049 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 394 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:32,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 674 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 00:49:32,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-07-14 00:49:32,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 423. [2022-07-14 00:49:32,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 322 states have (on average 1.279503105590062) internal successors, (412), 329 states have internal predecessors, (412), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-07-14 00:49:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 552 transitions. [2022-07-14 00:49:32,096 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 552 transitions. Word has length 32 [2022-07-14 00:49:32,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:32,097 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 552 transitions. [2022-07-14 00:49:32,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 00:49:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 552 transitions. [2022-07-14 00:49:32,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 00:49:32,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:32,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:32,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 00:49:32,104 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:32,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:32,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1956153286, now seen corresponding path program 1 times [2022-07-14 00:49:32,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:32,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392831555] [2022-07-14 00:49:32,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:32,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:32,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:32,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:32,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:32,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:32,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:32,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-14 00:49:32,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:32,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392831555] [2022-07-14 00:49:32,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392831555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:32,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:32,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:49:32,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590683448] [2022-07-14 00:49:32,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:32,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:49:32,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:32,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:49:32,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:49:32,236 INFO L87 Difference]: Start difference. First operand 423 states and 552 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 00:49:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:32,784 INFO L93 Difference]: Finished difference Result 1000 states and 1346 transitions. [2022-07-14 00:49:32,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 00:49:32,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-07-14 00:49:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:32,787 INFO L225 Difference]: With dead ends: 1000 [2022-07-14 00:49:32,787 INFO L226 Difference]: Without dead ends: 592 [2022-07-14 00:49:32,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:49:32,788 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 626 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:32,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1536 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 00:49:32,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-07-14 00:49:32,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 426. [2022-07-14 00:49:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 325 states have (on average 1.2738461538461539) internal successors, (414), 332 states have internal predecessors, (414), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-07-14 00:49:32,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 554 transitions. [2022-07-14 00:49:32,805 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 554 transitions. Word has length 55 [2022-07-14 00:49:32,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:32,806 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 554 transitions. [2022-07-14 00:49:32,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 00:49:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 554 transitions. [2022-07-14 00:49:32,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 00:49:32,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:32,807 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:32,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 00:49:32,807 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:32,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:32,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1601497338, now seen corresponding path program 1 times [2022-07-14 00:49:32,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:32,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139873192] [2022-07-14 00:49:32,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:32,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:32,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:32,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:32,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:32,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:32,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:32,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-14 00:49:32,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:32,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139873192] [2022-07-14 00:49:32,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139873192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:32,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:32,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:49:32,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289486152] [2022-07-14 00:49:32,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:32,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:49:32,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:32,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:49:32,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:49:32,897 INFO L87 Difference]: Start difference. First operand 426 states and 554 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 00:49:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:33,206 INFO L93 Difference]: Finished difference Result 1269 states and 1671 transitions. [2022-07-14 00:49:33,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:49:33,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2022-07-14 00:49:33,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:33,210 INFO L225 Difference]: With dead ends: 1269 [2022-07-14 00:49:33,210 INFO L226 Difference]: Without dead ends: 858 [2022-07-14 00:49:33,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:49:33,212 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 391 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:33,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 779 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 00:49:33,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2022-07-14 00:49:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 828. [2022-07-14 00:49:33,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 636 states have (on average 1.2688679245283019) internal successors, (807), 647 states have internal predecessors, (807), 137 states have call successors, (137), 55 states have call predecessors, (137), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-07-14 00:49:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1077 transitions. [2022-07-14 00:49:33,266 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1077 transitions. Word has length 55 [2022-07-14 00:49:33,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:33,266 INFO L495 AbstractCegarLoop]: Abstraction has 828 states and 1077 transitions. [2022-07-14 00:49:33,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 00:49:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1077 transitions. [2022-07-14 00:49:33,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 00:49:33,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:33,267 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:33,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 00:49:33,268 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:33,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:33,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1893200283, now seen corresponding path program 1 times [2022-07-14 00:49:33,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:33,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919018847] [2022-07-14 00:49:33,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:33,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:33,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:33,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:33,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:33,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:33,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:33,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-14 00:49:33,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:33,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919018847] [2022-07-14 00:49:33,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919018847] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:33,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:33,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:49:33,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409324382] [2022-07-14 00:49:33,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:33,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:49:33,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:33,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:49:33,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:49:33,364 INFO L87 Difference]: Start difference. First operand 828 states and 1077 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 00:49:33,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:33,584 INFO L93 Difference]: Finished difference Result 858 states and 1126 transitions. [2022-07-14 00:49:33,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:49:33,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2022-07-14 00:49:33,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:33,587 INFO L225 Difference]: With dead ends: 858 [2022-07-14 00:49:33,587 INFO L226 Difference]: Without dead ends: 855 [2022-07-14 00:49:33,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:49:33,589 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 279 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:33,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 599 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 00:49:33,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-07-14 00:49:33,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 827. [2022-07-14 00:49:33,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 636 states have (on average 1.2672955974842768) internal successors, (806), 646 states have internal predecessors, (806), 136 states have call successors, (136), 55 states have call predecessors, (136), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-07-14 00:49:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1075 transitions. [2022-07-14 00:49:33,619 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1075 transitions. Word has length 56 [2022-07-14 00:49:33,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:33,619 INFO L495 AbstractCegarLoop]: Abstraction has 827 states and 1075 transitions. [2022-07-14 00:49:33,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 00:49:33,620 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1075 transitions. [2022-07-14 00:49:33,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-14 00:49:33,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:33,621 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:33,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 00:49:33,621 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:33,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:33,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1440318295, now seen corresponding path program 1 times [2022-07-14 00:49:33,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:33,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221908369] [2022-07-14 00:49:33,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:33,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:33,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:33,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:33,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:33,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:33,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:33,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-14 00:49:33,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:33,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221908369] [2022-07-14 00:49:33,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221908369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:33,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:33,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:49:33,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203126860] [2022-07-14 00:49:33,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:33,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:49:33,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:33,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:49:33,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:49:33,753 INFO L87 Difference]: Start difference. First operand 827 states and 1075 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 00:49:33,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:33,997 INFO L93 Difference]: Finished difference Result 857 states and 1124 transitions. [2022-07-14 00:49:33,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:49:33,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-14 00:49:33,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:34,001 INFO L225 Difference]: With dead ends: 857 [2022-07-14 00:49:34,001 INFO L226 Difference]: Without dead ends: 854 [2022-07-14 00:49:34,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:49:34,002 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 276 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:34,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 595 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 00:49:34,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-07-14 00:49:34,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 826. [2022-07-14 00:49:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 636 states have (on average 1.2657232704402517) internal successors, (805), 645 states have internal predecessors, (805), 135 states have call successors, (135), 55 states have call predecessors, (135), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-07-14 00:49:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1073 transitions. [2022-07-14 00:49:34,032 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1073 transitions. Word has length 57 [2022-07-14 00:49:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:34,032 INFO L495 AbstractCegarLoop]: Abstraction has 826 states and 1073 transitions. [2022-07-14 00:49:34,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 00:49:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1073 transitions. [2022-07-14 00:49:34,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 00:49:34,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:34,034 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:34,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 00:49:34,034 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:34,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:34,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1700174242, now seen corresponding path program 1 times [2022-07-14 00:49:34,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:34,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736932727] [2022-07-14 00:49:34,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:34,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,102 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-14 00:49:34,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:34,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736932727] [2022-07-14 00:49:34,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736932727] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:34,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:34,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:49:34,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449609633] [2022-07-14 00:49:34,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:34,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:49:34,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:34,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:49:34,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:49:34,104 INFO L87 Difference]: Start difference. First operand 826 states and 1073 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 00:49:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:34,374 INFO L93 Difference]: Finished difference Result 856 states and 1122 transitions. [2022-07-14 00:49:34,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:49:34,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-07-14 00:49:34,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:34,377 INFO L225 Difference]: With dead ends: 856 [2022-07-14 00:49:34,377 INFO L226 Difference]: Without dead ends: 845 [2022-07-14 00:49:34,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:49:34,378 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 273 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:34,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 594 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 00:49:34,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-07-14 00:49:34,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 817. [2022-07-14 00:49:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 628 states have (on average 1.2643312101910829) internal successors, (794), 636 states have internal predecessors, (794), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-07-14 00:49:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1061 transitions. [2022-07-14 00:49:34,402 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1061 transitions. Word has length 58 [2022-07-14 00:49:34,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:34,424 INFO L495 AbstractCegarLoop]: Abstraction has 817 states and 1061 transitions. [2022-07-14 00:49:34,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 00:49:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1061 transitions. [2022-07-14 00:49:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-14 00:49:34,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:34,427 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:34,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 00:49:34,427 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:34,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1841089283, now seen corresponding path program 1 times [2022-07-14 00:49:34,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:34,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247577996] [2022-07-14 00:49:34,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:34,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:49:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 00:49:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 00:49:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:49:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:49:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:49:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:49:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 00:49:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 00:49:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 00:49:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:34,585 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-14 00:49:34,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:34,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247577996] [2022-07-14 00:49:34,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247577996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:34,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:34,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:49:34,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752922191] [2022-07-14 00:49:34,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:34,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:49:34,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:34,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:49:34,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:49:34,586 INFO L87 Difference]: Start difference. First operand 817 states and 1061 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 00:49:34,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:34,928 INFO L93 Difference]: Finished difference Result 1711 states and 2241 transitions. [2022-07-14 00:49:34,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:49:34,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 153 [2022-07-14 00:49:34,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:34,932 INFO L225 Difference]: With dead ends: 1711 [2022-07-14 00:49:34,932 INFO L226 Difference]: Without dead ends: 909 [2022-07-14 00:49:34,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:49:34,934 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 90 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:34,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1119 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 00:49:34,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2022-07-14 00:49:34,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 871. [2022-07-14 00:49:34,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 681 states have (on average 1.2745961820851688) internal successors, (868), 689 states have internal predecessors, (868), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-07-14 00:49:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1135 transitions. [2022-07-14 00:49:34,967 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1135 transitions. Word has length 153 [2022-07-14 00:49:34,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:34,967 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1135 transitions. [2022-07-14 00:49:34,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 00:49:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1135 transitions. [2022-07-14 00:49:34,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-14 00:49:34,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:34,969 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:34,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 00:49:34,969 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:34,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:34,970 INFO L85 PathProgramCache]: Analyzing trace with hash 314942574, now seen corresponding path program 1 times [2022-07-14 00:49:34,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:34,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226614407] [2022-07-14 00:49:34,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:34,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:49:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 00:49:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 00:49:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 00:49:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 00:49:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 00:49:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:49:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 00:49:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 00:49:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 00:49:35,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:35,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226614407] [2022-07-14 00:49:35,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226614407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:35,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:35,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 00:49:35,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283655861] [2022-07-14 00:49:35,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:35,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 00:49:35,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:35,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 00:49:35,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:49:35,127 INFO L87 Difference]: Start difference. First operand 871 states and 1135 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 00:49:35,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:35,503 INFO L93 Difference]: Finished difference Result 2321 states and 3120 transitions. [2022-07-14 00:49:35,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:49:35,504 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 162 [2022-07-14 00:49:35,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:35,509 INFO L225 Difference]: With dead ends: 2321 [2022-07-14 00:49:35,509 INFO L226 Difference]: Without dead ends: 1469 [2022-07-14 00:49:35,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:49:35,512 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 450 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:35,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1833 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 00:49:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2022-07-14 00:49:35,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 883. [2022-07-14 00:49:35,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 693 states have (on average 1.2698412698412698) internal successors, (880), 701 states have internal predecessors, (880), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-07-14 00:49:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1147 transitions. [2022-07-14 00:49:35,545 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1147 transitions. Word has length 162 [2022-07-14 00:49:35,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:35,546 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1147 transitions. [2022-07-14 00:49:35,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 00:49:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1147 transitions. [2022-07-14 00:49:35,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-14 00:49:35,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:35,548 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:35,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 00:49:35,548 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:35,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:35,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1067823865, now seen corresponding path program 1 times [2022-07-14 00:49:35,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:35,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211801976] [2022-07-14 00:49:35,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:35,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:49:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:49:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:49:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 00:49:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:49:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:49:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 00:49:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:49:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 00:49:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:35,728 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 00:49:35,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:35,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211801976] [2022-07-14 00:49:35,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211801976] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:49:35,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087019341] [2022-07-14 00:49:35,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:35,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:49:35,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:49:35,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:49:35,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 00:49:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 1317 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 00:49:36,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:49:36,087 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 00:49:36,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:49:36,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087019341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:36,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:49:36,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-14 00:49:36,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182982624] [2022-07-14 00:49:36,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:36,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:49:36,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:36,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:49:36,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:49:36,090 INFO L87 Difference]: Start difference. First operand 883 states and 1147 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 00:49:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:36,243 INFO L93 Difference]: Finished difference Result 2857 states and 3742 transitions. [2022-07-14 00:49:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:49:36,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2022-07-14 00:49:36,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:36,251 INFO L225 Difference]: With dead ends: 2857 [2022-07-14 00:49:36,251 INFO L226 Difference]: Without dead ends: 1993 [2022-07-14 00:49:36,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-07-14 00:49:36,254 INFO L413 NwaCegarLoop]: 594 mSDtfsCounter, 401 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:36,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1915 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:49:36,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2022-07-14 00:49:36,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 919. [2022-07-14 00:49:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 721 states have (on average 1.259361997226075) internal successors, (908), 729 states have internal predecessors, (908), 142 states have call successors, (142), 56 states have call predecessors, (142), 55 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-07-14 00:49:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1191 transitions. [2022-07-14 00:49:36,304 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1191 transitions. Word has length 164 [2022-07-14 00:49:36,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:36,305 INFO L495 AbstractCegarLoop]: Abstraction has 919 states and 1191 transitions. [2022-07-14 00:49:36,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 00:49:36,305 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1191 transitions. [2022-07-14 00:49:36,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-14 00:49:36,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:36,307 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:36,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 00:49:36,529 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,SelfDestructingSolverStorable9 [2022-07-14 00:49:36,530 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:36,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:36,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2078941115, now seen corresponding path program 1 times [2022-07-14 00:49:36,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:36,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773482963] [2022-07-14 00:49:36,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:36,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:49:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:49:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:49:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 00:49:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:49:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:49:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 00:49:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:49:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 00:49:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-14 00:49:36,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:36,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773482963] [2022-07-14 00:49:36,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773482963] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:49:36,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303858447] [2022-07-14 00:49:36,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:36,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:49:36,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:49:36,741 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:49:36,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 00:49:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-14 00:49:37,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:49:37,164 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-14 00:49:37,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:49:37,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303858447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:37,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:49:37,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2022-07-14 00:49:37,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927606025] [2022-07-14 00:49:37,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:37,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:49:37,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:37,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:49:37,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:49:37,166 INFO L87 Difference]: Start difference. First operand 919 states and 1191 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 00:49:37,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:37,264 INFO L93 Difference]: Finished difference Result 2201 states and 2930 transitions. [2022-07-14 00:49:37,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:49:37,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2022-07-14 00:49:37,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:37,270 INFO L225 Difference]: With dead ends: 2201 [2022-07-14 00:49:37,270 INFO L226 Difference]: Without dead ends: 1301 [2022-07-14 00:49:37,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-14 00:49:37,272 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 97 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:37,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1903 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:49:37,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2022-07-14 00:49:37,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 939. [2022-07-14 00:49:37,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 737 states have (on average 1.2537313432835822) internal successors, (924), 745 states have internal predecessors, (924), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 145 states have call predecessors, (161), 141 states have call successors, (161) [2022-07-14 00:49:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1227 transitions. [2022-07-14 00:49:37,326 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1227 transitions. Word has length 164 [2022-07-14 00:49:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:37,326 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1227 transitions. [2022-07-14 00:49:37,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 00:49:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1227 transitions. [2022-07-14 00:49:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-14 00:49:37,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:37,328 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:37,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 00:49:37,547 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,SelfDestructingSolverStorable10 [2022-07-14 00:49:37,547 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:37,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:37,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1954792649, now seen corresponding path program 1 times [2022-07-14 00:49:37,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:37,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414846385] [2022-07-14 00:49:37,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:37,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:49:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:49:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:49:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 00:49:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:49:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:49:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-14 00:49:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-14 00:49:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-14 00:49:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 00:49:37,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:37,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414846385] [2022-07-14 00:49:37,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414846385] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:49:37,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181716966] [2022-07-14 00:49:37,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:37,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:49:37,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:49:37,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:49:37,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 00:49:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:37,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 00:49:38,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:49:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-14 00:49:38,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:49:38,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181716966] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:38,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:49:38,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-07-14 00:49:38,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287127838] [2022-07-14 00:49:38,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:38,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:49:38,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:38,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:49:38,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:49:38,028 INFO L87 Difference]: Start difference. First operand 939 states and 1227 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 00:49:38,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:38,100 INFO L93 Difference]: Finished difference Result 1879 states and 2467 transitions. [2022-07-14 00:49:38,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:49:38,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 170 [2022-07-14 00:49:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:38,104 INFO L225 Difference]: With dead ends: 1879 [2022-07-14 00:49:38,105 INFO L226 Difference]: Without dead ends: 959 [2022-07-14 00:49:38,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:49:38,107 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 1 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:38,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1136 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:49:38,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-07-14 00:49:38,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 947. [2022-07-14 00:49:38,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 745 states have (on average 1.251006711409396) internal successors, (932), 749 states have internal predecessors, (932), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 149 states have call predecessors, (161), 141 states have call successors, (161) [2022-07-14 00:49:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1235 transitions. [2022-07-14 00:49:38,156 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1235 transitions. Word has length 170 [2022-07-14 00:49:38,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:38,157 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1235 transitions. [2022-07-14 00:49:38,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 00:49:38,157 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1235 transitions. [2022-07-14 00:49:38,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-14 00:49:38,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:38,159 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:38,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 00:49:38,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:49:38,379 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:38,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:38,379 INFO L85 PathProgramCache]: Analyzing trace with hash -794500219, now seen corresponding path program 2 times [2022-07-14 00:49:38,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:38,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905589668] [2022-07-14 00:49:38,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:38,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:49:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:49:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 00:49:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:49:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-14 00:49:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:49:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:49:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-14 00:49:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:49:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-14 00:49:38,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:38,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905589668] [2022-07-14 00:49:38,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905589668] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:49:38,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655130203] [2022-07-14 00:49:38,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 00:49:38,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:49:38,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:49:38,673 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:49:38,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 00:49:38,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 00:49:38,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:49:38,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-14 00:49:38,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:49:38,989 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-14 00:49:38,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:49:38,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655130203] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:38,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:49:38,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2022-07-14 00:49:38,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764807824] [2022-07-14 00:49:38,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:38,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:49:38,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:38,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:49:38,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-14 00:49:38,993 INFO L87 Difference]: Start difference. First operand 947 states and 1235 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 00:49:39,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:39,232 INFO L93 Difference]: Finished difference Result 1933 states and 2603 transitions. [2022-07-14 00:49:39,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:49:39,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 176 [2022-07-14 00:49:39,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:39,237 INFO L225 Difference]: With dead ends: 1933 [2022-07-14 00:49:39,237 INFO L226 Difference]: Without dead ends: 1465 [2022-07-14 00:49:39,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-07-14 00:49:39,239 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 611 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:39,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1863 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 00:49:39,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2022-07-14 00:49:39,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 953. [2022-07-14 00:49:39,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 751 states have (on average 1.2490013315579227) internal successors, (938), 755 states have internal predecessors, (938), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 149 states have call predecessors, (161), 141 states have call successors, (161) [2022-07-14 00:49:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1241 transitions. [2022-07-14 00:49:39,307 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1241 transitions. Word has length 176 [2022-07-14 00:49:39,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:39,308 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1241 transitions. [2022-07-14 00:49:39,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 00:49:39,308 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1241 transitions. [2022-07-14 00:49:39,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-14 00:49:39,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:39,310 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:39,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 00:49:39,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:49:39,524 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:39,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:39,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1273770335, now seen corresponding path program 1 times [2022-07-14 00:49:39,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:39,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589324419] [2022-07-14 00:49:39,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:39,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:49:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:49:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 00:49:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:49:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-14 00:49:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:49:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:49:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 00:49:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-14 00:49:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 00:49:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-14 00:49:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-14 00:49:39,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:39,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589324419] [2022-07-14 00:49:39,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589324419] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:49:39,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641374656] [2022-07-14 00:49:39,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:39,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:49:39,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:49:39,750 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:49:39,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 00:49:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:40,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 1804 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 00:49:40,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:49:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-14 00:49:40,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:49:40,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641374656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:40,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:49:40,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-14 00:49:40,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27780203] [2022-07-14 00:49:40,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:40,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:49:40,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:40,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:49:40,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:49:40,342 INFO L87 Difference]: Start difference. First operand 953 states and 1241 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 00:49:40,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:40,605 INFO L93 Difference]: Finished difference Result 2823 states and 3686 transitions. [2022-07-14 00:49:40,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:49:40,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 207 [2022-07-14 00:49:40,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:40,616 INFO L225 Difference]: With dead ends: 2823 [2022-07-14 00:49:40,616 INFO L226 Difference]: Without dead ends: 2815 [2022-07-14 00:49:40,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:49:40,618 INFO L413 NwaCegarLoop]: 587 mSDtfsCounter, 410 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:40,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1103 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 00:49:40,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2022-07-14 00:49:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2801. [2022-07-14 00:49:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2801 states, 2211 states have (on average 1.252826775214835) internal successors, (2770), 2227 states have internal predecessors, (2770), 418 states have call successors, (418), 160 states have call predecessors, (418), 171 states have return successors, (477), 437 states have call predecessors, (477), 417 states have call successors, (477) [2022-07-14 00:49:40,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 3665 transitions. [2022-07-14 00:49:40,816 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 3665 transitions. Word has length 207 [2022-07-14 00:49:40,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:40,817 INFO L495 AbstractCegarLoop]: Abstraction has 2801 states and 3665 transitions. [2022-07-14 00:49:40,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 00:49:40,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 3665 transitions. [2022-07-14 00:49:40,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-14 00:49:40,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:40,820 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:40,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 00:49:41,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-14 00:49:41,040 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:41,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:41,040 INFO L85 PathProgramCache]: Analyzing trace with hash 262653085, now seen corresponding path program 1 times [2022-07-14 00:49:41,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:41,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081619361] [2022-07-14 00:49:41,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:41,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:49:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:49:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 00:49:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:49:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-14 00:49:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:49:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:49:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 00:49:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-14 00:49:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 00:49:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-14 00:49:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-14 00:49:41,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:41,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081619361] [2022-07-14 00:49:41,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081619361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:41,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:41,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:49:41,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109722365] [2022-07-14 00:49:41,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:41,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:49:41,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:49:41,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:49:41,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:49:41,198 INFO L87 Difference]: Start difference. First operand 2801 states and 3665 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-14 00:49:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:42,118 INFO L93 Difference]: Finished difference Result 8991 states and 11824 transitions. [2022-07-14 00:49:42,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 00:49:42,119 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 207 [2022-07-14 00:49:42,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:42,169 INFO L225 Difference]: With dead ends: 8991 [2022-07-14 00:49:42,169 INFO L226 Difference]: Without dead ends: 6209 [2022-07-14 00:49:42,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-14 00:49:42,175 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 472 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:42,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1553 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 00:49:42,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6209 states. [2022-07-14 00:49:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6209 to 2813. [2022-07-14 00:49:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2223 states have (on average 1.2514619883040936) internal successors, (2782), 2243 states have internal predecessors, (2782), 418 states have call successors, (418), 160 states have call predecessors, (418), 171 states have return successors, (477), 433 states have call predecessors, (477), 417 states have call successors, (477) [2022-07-14 00:49:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 3677 transitions. [2022-07-14 00:49:42,394 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 3677 transitions. Word has length 207 [2022-07-14 00:49:42,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:42,395 INFO L495 AbstractCegarLoop]: Abstraction has 2813 states and 3677 transitions. [2022-07-14 00:49:42,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-14 00:49:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3677 transitions. [2022-07-14 00:49:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-14 00:49:42,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:42,403 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:42,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 00:49:42,404 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:42,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:42,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1700386181, now seen corresponding path program 1 times [2022-07-14 00:49:42,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:49:42,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364785928] [2022-07-14 00:49:42,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:42,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:49:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:49:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:49:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:49:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:49:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 00:49:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:49:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-14 00:49:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:49:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:49:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:49:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:49:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 00:49:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-14 00:49:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 00:49:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-14 00:49:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-14 00:49:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-07-14 00:49:42,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:49:42,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364785928] [2022-07-14 00:49:42,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364785928] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:49:42,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471407936] [2022-07-14 00:49:42,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:42,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:49:42,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:49:42,788 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:49:42,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 00:49:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:43,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 1818 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-14 00:49:43,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:49:43,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 00:49:43,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 00:49:43,575 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1026 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1026) |c_#memory_int|)) is different from true [2022-07-14 00:49:43,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 00:49:43,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:49:43,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 00:49:43,643 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 00:49:43,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 00:50:56,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 00:51:08,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 00:51:08,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 00:51:20,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 00:51:20,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 00:51:20,938 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 40 proven. 29 refuted. 0 times theorem prover too weak. 44 trivial. 2 not checked. [2022-07-14 00:51:20,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:51:20,958 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1035 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1035) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-07-14 00:51:20,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471407936] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:51:20,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:51:20,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 31] total 41 [2022-07-14 00:51:20,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63895661] [2022-07-14 00:51:20,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:51:20,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-14 00:51:20,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:51:20,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-14 00:51:20,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1426, Unknown=9, NotChecked=154, Total=1722 [2022-07-14 00:51:20,974 INFO L87 Difference]: Start difference. First operand 2813 states and 3677 transitions. Second operand has 41 states, 38 states have (on average 6.552631578947368) internal successors, (249), 28 states have internal predecessors, (249), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) [2022-07-14 00:52:42,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:52:42,840 INFO L93 Difference]: Finished difference Result 7649 states and 10194 transitions. [2022-07-14 00:52:42,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-14 00:52:42,841 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 6.552631578947368) internal successors, (249), 28 states have internal predecessors, (249), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) Word has length 214 [2022-07-14 00:52:42,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:52:42,859 INFO L225 Difference]: With dead ends: 7649 [2022-07-14 00:52:42,859 INFO L226 Difference]: Without dead ends: 4855 [2022-07-14 00:52:42,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 275 SyntacticMatches, 14 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 177.7s TimeCoverageRelationStatistics Valid=322, Invalid=3798, Unknown=48, NotChecked=254, Total=4422 [2022-07-14 00:52:42,867 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 661 mSDsluCounter, 7631 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 8119 SdHoareTripleChecker+Invalid, 3179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1378 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 00:52:42,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 8119 Invalid, 3179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1595 Invalid, 0 Unknown, 1378 Unchecked, 0.9s Time] [2022-07-14 00:52:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4855 states. [2022-07-14 00:52:43,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4855 to 3317. [2022-07-14 00:52:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 2652 states have (on average 1.254524886877828) internal successors, (3327), 2664 states have internal predecessors, (3327), 457 states have call successors, (457), 180 states have call predecessors, (457), 207 states have return successors, (564), 496 states have call predecessors, (564), 456 states have call successors, (564) [2022-07-14 00:52:43,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4348 transitions. [2022-07-14 00:52:43,113 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4348 transitions. Word has length 214 [2022-07-14 00:52:43,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:52:43,113 INFO L495 AbstractCegarLoop]: Abstraction has 3317 states and 4348 transitions. [2022-07-14 00:52:43,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 6.552631578947368) internal successors, (249), 28 states have internal predecessors, (249), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) [2022-07-14 00:52:43,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4348 transitions. [2022-07-14 00:52:43,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-14 00:52:43,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:52:43,119 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:52:43,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 00:52:43,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-14 00:52:43,336 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:52:43,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:52:43,336 INFO L85 PathProgramCache]: Analyzing trace with hash -250016649, now seen corresponding path program 2 times [2022-07-14 00:52:43,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:52:43,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362904992] [2022-07-14 00:52:43,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:52:43,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:52:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:52:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:52:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:52:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:52:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:52:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:52:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:52:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:52:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:52:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 00:52:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:52:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:52:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:52:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 00:52:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:52:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 00:52:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:52:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-14 00:52:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-14 00:52:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-14 00:52:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-14 00:52:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-14 00:52:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-14 00:52:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:52:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-07-14 00:52:43,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:52:43,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362904992] [2022-07-14 00:52:43,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362904992] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:52:43,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816755214] [2022-07-14 00:52:43,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 00:52:43,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:52:43,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:52:43,672 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:52:43,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 00:52:44,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 00:52:44,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:52:44,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 1844 conjuncts, 112 conjunts are in the unsatisfiable core [2022-07-14 00:52:44,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:52:44,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 00:52:44,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 00:52:44,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-14 00:52:44,420 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1316 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1316) |c_#memory_int|)) is different from true [2022-07-14 00:52:44,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-14 00:52:44,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 00:52:44,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:52:44,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 00:52:44,496 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 00:52:44,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 00:52:44,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 00:52:52,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-14 00:53:04,748 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 00:53:04,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 00:53:04,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 00:53:21,259 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 00:53:21,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 00:53:45,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 00:53:57,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 00:53:57,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15