./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_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-?-6c24879 [2022-07-12 13:08:51,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 13:08:51,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 13:08:51,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 13:08:51,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 13:08:51,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 13:08:51,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 13:08:51,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 13:08:51,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 13:08:51,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 13:08:51,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 13:08:51,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 13:08:51,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 13:08:51,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 13:08:51,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 13:08:51,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 13:08:51,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 13:08:51,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 13:08:51,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 13:08:51,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 13:08:51,425 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 13:08:51,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 13:08:51,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 13:08:51,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 13:08:51,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 13:08:51,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 13:08:51,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 13:08:51,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 13:08:51,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 13:08:51,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 13:08:51,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 13:08:51,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 13:08:51,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 13:08:51,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 13:08:51,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 13:08:51,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 13:08:51,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 13:08:51,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 13:08:51,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 13:08:51,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 13:08:51,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 13:08:51,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 13:08:51,439 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 13:08:51,466 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 13:08:51,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 13:08:51,466 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 13:08:51,466 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 13:08:51,467 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 13:08:51,467 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 13:08:51,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 13:08:51,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 13:08:51,468 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 13:08:51,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 13:08:51,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 13:08:51,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 13:08:51,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 13:08:51,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 13:08:51,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 13:08:51,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 13:08:51,469 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 13:08:51,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 13:08:51,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 13:08:51,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 13:08:51,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 13:08:51,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 13:08:51,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 13:08:51,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 13:08:51,471 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 13:08:51,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 13:08:51,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 13:08:51,471 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 13:08:51,471 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 13:08:51,471 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 13:08:51,471 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-12 13:08:51,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 13:08:51,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 13:08:51,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 13:08:51,713 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 13:08:51,713 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 13:08:51,714 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-12 13:08:51,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664e0e4dc/c773cdddda2b4dfaa68af0678ad827d7/FLAG56c8ce3ed [2022-07-12 13:08:52,262 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 13:08:52,263 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-12 13:08:52,297 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664e0e4dc/c773cdddda2b4dfaa68af0678ad827d7/FLAG56c8ce3ed [2022-07-12 13:08:52,547 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664e0e4dc/c773cdddda2b4dfaa68af0678ad827d7 [2022-07-12 13:08:52,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 13:08:52,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 13:08:52,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 13:08:52,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 13:08:52,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 13:08:52,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:08:52" (1/1) ... [2022-07-12 13:08:52,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72052fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:08:52, skipping insertion in model container [2022-07-12 13:08:52,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:08:52" (1/1) ... [2022-07-12 13:08:52,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 13:08:52,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 13:08:53,162 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-12 13:08:53,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:08:53,197 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 13:08:53,325 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-12 13:08:53,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:08:53,376 INFO L208 MainTranslator]: Completed translation [2022-07-12 13:08:53,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:08:53 WrapperNode [2022-07-12 13:08:53,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 13:08:53,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 13:08:53,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 13:08:53,380 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 13:08:53,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:08:53" (1/1) ... [2022-07-12 13:08:53,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:08:53" (1/1) ... [2022-07-12 13:08:53,471 INFO L137 Inliner]: procedures = 109, calls = 313, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 781 [2022-07-12 13:08:53,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 13:08:53,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 13:08:53,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 13:08:53,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 13:08:53,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:08:53" (1/1) ... [2022-07-12 13:08:53,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:08:53" (1/1) ... [2022-07-12 13:08:53,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:08:53" (1/1) ... [2022-07-12 13:08:53,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:08:53" (1/1) ... [2022-07-12 13:08:53,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:08:53" (1/1) ... [2022-07-12 13:08:53,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:08:53" (1/1) ... [2022-07-12 13:08:53,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:08:53" (1/1) ... [2022-07-12 13:08:53,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 13:08:53,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 13:08:53,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 13:08:53,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 13:08:53,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:08:53" (1/1) ... [2022-07-12 13:08:53,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 13:08:53,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:08:53,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 13:08:53,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 13:08:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 13:08:53,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 13:08:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 13:08:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 13:08:53,625 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 13:08:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 13:08:53,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 13:08:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 13:08:53,626 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 13:08:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-07-12 13:08:53,626 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-07-12 13:08:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 13:08:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 13:08:53,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 13:08:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 13:08:53,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 13:08:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-07-12 13:08:53,627 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-07-12 13:08:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-12 13:08:53,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-12 13:08:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 13:08:53,628 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 13:08:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 13:08:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 13:08:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 13:08:53,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 13:08:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 13:08:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-12 13:08:53,628 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-12 13:08:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-12 13:08:53,629 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-12 13:08:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-07-12 13:08:53,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-07-12 13:08:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 13:08:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 13:08:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 13:08:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-12 13:08:53,629 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-12 13:08:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 13:08:53,630 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 13:08:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 13:08:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 13:08:53,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 13:08:53,829 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 13:08:53,831 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 13:08:53,924 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 13:08:54,404 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 13:08:54,414 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 13:08:54,414 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 13:08:54,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:08:54 BoogieIcfgContainer [2022-07-12 13:08:54,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 13:08:54,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 13:08:54,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 13:08:54,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 13:08:54,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 01:08:52" (1/3) ... [2022-07-12 13:08:54,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431d1fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:08:54, skipping insertion in model container [2022-07-12 13:08:54,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:08:53" (2/3) ... [2022-07-12 13:08:54,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431d1fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:08:54, skipping insertion in model container [2022-07-12 13:08:54,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:08:54" (3/3) ... [2022-07-12 13:08:54,425 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-12 13:08:54,435 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 13:08:54,436 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 13:08:54,483 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 13:08:54,487 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@41168688, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@54ac31fe [2022-07-12 13:08:54,487 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 13:08:54,491 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-12 13:08:54,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 13:08:54,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:08:54,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:08:54,498 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:08:54,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:08:54,506 INFO L85 PathProgramCache]: Analyzing trace with hash -949146533, now seen corresponding path program 1 times [2022-07-12 13:08:54,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:08:54,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439977367] [2022-07-12 13:08:54,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:08:54,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:08:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:54,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:08:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:54,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:54,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:08:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 13:08:54,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:08:54,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439977367] [2022-07-12 13:08:54,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439977367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:08:54,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:08:54,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 13:08:54,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124175284] [2022-07-12 13:08:54,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:08:54,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 13:08:54,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:08:54,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 13:08:54,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 13:08:54,868 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-12 13:08:55,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:08:55,152 INFO L93 Difference]: Finished difference Result 476 states and 652 transitions. [2022-07-12 13:08:55,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 13:08:55,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-07-12 13:08:55,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:08:55,162 INFO L225 Difference]: With dead ends: 476 [2022-07-12 13:08:55,163 INFO L226 Difference]: Without dead ends: 233 [2022-07-12 13:08:55,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 13:08:55,168 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-12 13:08:55,169 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-12 13:08:55,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-12 13:08:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 226. [2022-07-12 13:08:55,205 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-12 13:08:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 295 transitions. [2022-07-12 13:08:55,208 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 295 transitions. Word has length 32 [2022-07-12 13:08:55,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:08:55,208 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 295 transitions. [2022-07-12 13:08:55,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 13:08:55,209 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 295 transitions. [2022-07-12 13:08:55,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 13:08:55,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:08:55,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:08:55,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 13:08:55,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:08:55,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:08:55,211 INFO L85 PathProgramCache]: Analyzing trace with hash -526444707, now seen corresponding path program 1 times [2022-07-12 13:08:55,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:08:55,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108597092] [2022-07-12 13:08:55,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:08:55,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:08:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:55,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:08:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:55,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:55,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:08:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 13:08:55,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:08:55,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108597092] [2022-07-12 13:08:55,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108597092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:08:55,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:08:55,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:08:55,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232845443] [2022-07-12 13:08:55,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:08:55,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:08:55,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:08:55,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:08:55,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:08:55,369 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-12 13:08:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:08:55,790 INFO L93 Difference]: Finished difference Result 658 states and 868 transitions. [2022-07-12 13:08:55,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 13:08:55,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-07-12 13:08:55,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:08:55,794 INFO L225 Difference]: With dead ends: 658 [2022-07-12 13:08:55,794 INFO L226 Difference]: Without dead ends: 437 [2022-07-12 13:08:55,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:08:55,796 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-12 13:08:55,796 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-12 13:08:55,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-07-12 13:08:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 423. [2022-07-12 13:08:55,818 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-12 13:08:55,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 552 transitions. [2022-07-12 13:08:55,825 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 552 transitions. Word has length 32 [2022-07-12 13:08:55,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:08:55,825 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 552 transitions. [2022-07-12 13:08:55,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 13:08:55,826 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 552 transitions. [2022-07-12 13:08:55,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 13:08:55,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:08:55,827 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:08:55,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 13:08:55,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:08:55,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:08:55,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1956153286, now seen corresponding path program 1 times [2022-07-12 13:08:55,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:08:55,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636844998] [2022-07-12 13:08:55,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:08:55,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:08:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:55,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:08:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:55,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:55,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:08:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:55,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:08:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:55,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:55,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:08:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 13:08:55,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:08:55,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636844998] [2022-07-12 13:08:55,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636844998] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:08:55,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:08:55,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:08:55,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565959666] [2022-07-12 13:08:55,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:08:55,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:08:55,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:08:55,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:08:55,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:08:55,941 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-12 13:08:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:08:56,509 INFO L93 Difference]: Finished difference Result 1000 states and 1346 transitions. [2022-07-12 13:08:56,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 13:08:56,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-07-12 13:08:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:08:56,513 INFO L225 Difference]: With dead ends: 1000 [2022-07-12 13:08:56,513 INFO L226 Difference]: Without dead ends: 592 [2022-07-12 13:08:56,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:08:56,515 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-12 13:08:56,515 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-12 13:08:56,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-07-12 13:08:56,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 426. [2022-07-12 13:08:56,538 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-12 13:08:56,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 554 transitions. [2022-07-12 13:08:56,540 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 554 transitions. Word has length 55 [2022-07-12 13:08:56,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:08:56,540 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 554 transitions. [2022-07-12 13:08:56,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 13:08:56,541 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 554 transitions. [2022-07-12 13:08:56,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 13:08:56,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:08:56,542 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:08:56,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 13:08:56,542 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:08:56,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:08:56,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1601497338, now seen corresponding path program 1 times [2022-07-12 13:08:56,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:08:56,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538675820] [2022-07-12 13:08:56,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:08:56,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:08:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:56,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:08:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:56,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:56,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:08:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:56,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:08:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:56,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:56,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:08:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 13:08:56,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:08:56,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538675820] [2022-07-12 13:08:56,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538675820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:08:56,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:08:56,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:08:56,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948295035] [2022-07-12 13:08:56,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:08:56,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:08:56,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:08:56,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:08:56,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:08:56,658 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-12 13:08:57,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:08:57,005 INFO L93 Difference]: Finished difference Result 1269 states and 1671 transitions. [2022-07-12 13:08:57,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 13:08:57,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2022-07-12 13:08:57,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:08:57,009 INFO L225 Difference]: With dead ends: 1269 [2022-07-12 13:08:57,009 INFO L226 Difference]: Without dead ends: 858 [2022-07-12 13:08:57,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:08:57,011 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 391 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-12 13:08:57,011 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-12 13:08:57,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2022-07-12 13:08:57,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 828. [2022-07-12 13:08:57,046 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-12 13:08:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1077 transitions. [2022-07-12 13:08:57,049 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1077 transitions. Word has length 55 [2022-07-12 13:08:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:08:57,049 INFO L495 AbstractCegarLoop]: Abstraction has 828 states and 1077 transitions. [2022-07-12 13:08:57,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 13:08:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1077 transitions. [2022-07-12 13:08:57,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 13:08:57,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:08:57,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:08:57,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 13:08:57,052 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:08:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:08:57,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1893200283, now seen corresponding path program 1 times [2022-07-12 13:08:57,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:08:57,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37111984] [2022-07-12 13:08:57,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:08:57,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:08:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:08:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:08:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:08:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:08:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 13:08:57,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:08:57,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37111984] [2022-07-12 13:08:57,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37111984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:08:57,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:08:57,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:08:57,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945331734] [2022-07-12 13:08:57,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:08:57,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:08:57,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:08:57,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:08:57,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:08:57,137 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-12 13:08:57,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:08:57,390 INFO L93 Difference]: Finished difference Result 858 states and 1126 transitions. [2022-07-12 13:08:57,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 13:08:57,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2022-07-12 13:08:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:08:57,395 INFO L225 Difference]: With dead ends: 858 [2022-07-12 13:08:57,395 INFO L226 Difference]: Without dead ends: 855 [2022-07-12 13:08:57,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:08:57,397 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-12 13:08:57,398 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-12 13:08:57,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-07-12 13:08:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 827. [2022-07-12 13:08:57,432 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-12 13:08:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1075 transitions. [2022-07-12 13:08:57,435 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1075 transitions. Word has length 56 [2022-07-12 13:08:57,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:08:57,436 INFO L495 AbstractCegarLoop]: Abstraction has 827 states and 1075 transitions. [2022-07-12 13:08:57,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 13:08:57,436 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1075 transitions. [2022-07-12 13:08:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 13:08:57,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:08:57,439 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:08:57,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 13:08:57,439 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:08:57,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:08:57,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1440318295, now seen corresponding path program 1 times [2022-07-12 13:08:57,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:08:57,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474118985] [2022-07-12 13:08:57,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:08:57,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:08:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:08:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:08:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:08:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:08:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 13:08:57,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:08:57,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474118985] [2022-07-12 13:08:57,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474118985] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:08:57,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:08:57,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:08:57,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617715974] [2022-07-12 13:08:57,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:08:57,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:08:57,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:08:57,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:08:57,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:08:57,555 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-12 13:08:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:08:57,789 INFO L93 Difference]: Finished difference Result 857 states and 1124 transitions. [2022-07-12 13:08:57,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 13:08:57,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-12 13:08:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:08:57,793 INFO L225 Difference]: With dead ends: 857 [2022-07-12 13:08:57,793 INFO L226 Difference]: Without dead ends: 854 [2022-07-12 13:08:57,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:08:57,794 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-12 13:08:57,794 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-12 13:08:57,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-07-12 13:08:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 826. [2022-07-12 13:08:57,818 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-12 13:08:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1073 transitions. [2022-07-12 13:08:57,821 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1073 transitions. Word has length 57 [2022-07-12 13:08:57,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:08:57,822 INFO L495 AbstractCegarLoop]: Abstraction has 826 states and 1073 transitions. [2022-07-12 13:08:57,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 13:08:57,822 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1073 transitions. [2022-07-12 13:08:57,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 13:08:57,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:08:57,823 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:08:57,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 13:08:57,824 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:08:57,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:08:57,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1700174242, now seen corresponding path program 1 times [2022-07-12 13:08:57,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:08:57,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984865629] [2022-07-12 13:08:57,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:08:57,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:08:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:08:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:08:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:08:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:08:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 13:08:57,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:08:57,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984865629] [2022-07-12 13:08:57,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984865629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:08:57,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:08:57,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:08:57,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539756965] [2022-07-12 13:08:57,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:08:57,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:08:57,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:08:57,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:08:57,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:08:57,954 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-12 13:08:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:08:58,174 INFO L93 Difference]: Finished difference Result 856 states and 1122 transitions. [2022-07-12 13:08:58,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 13:08:58,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-07-12 13:08:58,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:08:58,178 INFO L225 Difference]: With dead ends: 856 [2022-07-12 13:08:58,178 INFO L226 Difference]: Without dead ends: 845 [2022-07-12 13:08:58,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:08:58,179 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-12 13:08:58,179 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-12 13:08:58,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-07-12 13:08:58,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 817. [2022-07-12 13:08:58,214 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-12 13:08:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1061 transitions. [2022-07-12 13:08:58,217 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1061 transitions. Word has length 58 [2022-07-12 13:08:58,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:08:58,218 INFO L495 AbstractCegarLoop]: Abstraction has 817 states and 1061 transitions. [2022-07-12 13:08:58,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 13:08:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1061 transitions. [2022-07-12 13:08:58,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-12 13:08:58,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:08:58,225 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-12 13:08:58,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 13:08:58,225 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:08:58,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:08:58,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1841089283, now seen corresponding path program 1 times [2022-07-12 13:08:58,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:08:58,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894813261] [2022-07-12 13:08:58,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:08:58,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:08:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:08:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:08:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 13:08:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 13:08:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 13:08:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 13:08:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 13:08:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 13:08:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 13:08:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 13:08:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 13:08:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 13:08:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:08:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-12 13:08:58,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:08:58,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894813261] [2022-07-12 13:08:58,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894813261] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:08:58,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:08:58,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:08:58,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757158594] [2022-07-12 13:08:58,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:08:58,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:08:58,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:08:58,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:08:58,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:08:58,385 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-12 13:08:58,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:08:58,737 INFO L93 Difference]: Finished difference Result 1711 states and 2241 transitions. [2022-07-12 13:08:58,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 13:08:58,738 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-12 13:08:58,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:08:58,741 INFO L225 Difference]: With dead ends: 1711 [2022-07-12 13:08:58,741 INFO L226 Difference]: Without dead ends: 909 [2022-07-12 13:08:58,743 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-12 13:08:58,743 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-12 13:08:58,744 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-12 13:08:58,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2022-07-12 13:08:58,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 871. [2022-07-12 13:08:58,767 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-12 13:08:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1135 transitions. [2022-07-12 13:08:58,779 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1135 transitions. Word has length 153 [2022-07-12 13:08:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:08:58,779 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1135 transitions. [2022-07-12 13:08:58,779 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-12 13:08:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1135 transitions. [2022-07-12 13:08:58,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-12 13:08:58,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:08:58,782 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-12 13:08:58,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 13:08:58,782 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:08:58,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:08:58,782 INFO L85 PathProgramCache]: Analyzing trace with hash 314942574, now seen corresponding path program 1 times [2022-07-12 13:08:58,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:08:58,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16186503] [2022-07-12 13:08:58,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:08:58,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:08:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:08:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:08:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:08:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:08:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:08:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 13:08:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 13:08:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 13:08:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 13:08:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 13:08:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:08:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 13:08:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 13:08:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 13:08:58,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:08:58,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16186503] [2022-07-12 13:08:58,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16186503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:08:58,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:08:58,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 13:08:58,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083746048] [2022-07-12 13:08:58,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:08:58,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 13:08:58,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:08:58,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 13:08:58,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:08:58,964 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-12 13:08:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:08:59,290 INFO L93 Difference]: Finished difference Result 2321 states and 3120 transitions. [2022-07-12 13:08:59,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 13:08:59,291 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-12 13:08:59,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:08:59,296 INFO L225 Difference]: With dead ends: 2321 [2022-07-12 13:08:59,296 INFO L226 Difference]: Without dead ends: 1469 [2022-07-12 13:08:59,298 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-12 13:08:59,298 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 450 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-12 13:08:59,298 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-12 13:08:59,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2022-07-12 13:08:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 883. [2022-07-12 13:08:59,328 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-12 13:08:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1147 transitions. [2022-07-12 13:08:59,331 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1147 transitions. Word has length 162 [2022-07-12 13:08:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:08:59,331 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1147 transitions. [2022-07-12 13:08:59,331 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-12 13:08:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1147 transitions. [2022-07-12 13:08:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-12 13:08:59,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:08:59,333 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-12 13:08:59,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 13:08:59,333 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:08:59,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:08:59,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1067823865, now seen corresponding path program 1 times [2022-07-12 13:08:59,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:08:59,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116752972] [2022-07-12 13:08:59,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:08:59,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:08:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:08:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:08:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:08:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:08:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:08:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 13:08:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:08:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 13:08:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:08:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:08:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 13:08:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 13:08:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:08:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:08:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,501 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 13:08:59,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:08:59,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116752972] [2022-07-12 13:08:59,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116752972] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:08:59,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095440841] [2022-07-12 13:08:59,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:08:59,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:08:59,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:08:59,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:08:59,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 13:08:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:08:59,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 1317 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 13:08:59,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:08:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 13:08:59,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:08:59,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095440841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:08:59,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:08:59,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-12 13:08:59,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946516627] [2022-07-12 13:08:59,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:08:59,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:08:59,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:08:59,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:08:59,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:08:59,857 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-12 13:08:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:08:59,997 INFO L93 Difference]: Finished difference Result 2857 states and 3742 transitions. [2022-07-12 13:08:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 13:08:59,997 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-12 13:08:59,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:00,004 INFO L225 Difference]: With dead ends: 2857 [2022-07-12 13:09:00,005 INFO L226 Difference]: Without dead ends: 1993 [2022-07-12 13:09:00,008 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-12 13:09:00,009 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-12 13:09:00,009 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-12 13:09:00,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2022-07-12 13:09:00,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 919. [2022-07-12 13:09:00,073 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-12 13:09:00,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1191 transitions. [2022-07-12 13:09:00,077 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1191 transitions. Word has length 164 [2022-07-12 13:09:00,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:00,077 INFO L495 AbstractCegarLoop]: Abstraction has 919 states and 1191 transitions. [2022-07-12 13:09:00,077 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-12 13:09:00,077 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1191 transitions. [2022-07-12 13:09:00,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-12 13:09:00,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:00,079 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-12 13:09:00,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 13:09:00,298 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-12 13:09:00,298 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:00,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:00,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2078941115, now seen corresponding path program 1 times [2022-07-12 13:09:00,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:00,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243108788] [2022-07-12 13:09:00,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:00,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:09:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 13:09:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:09:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 13:09:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:09:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 13:09:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 13:09:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:09:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:09:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-12 13:09:00,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:00,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243108788] [2022-07-12 13:09:00,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243108788] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:09:00,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107601586] [2022-07-12 13:09:00,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:00,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:09:00,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:09:00,476 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:09:00,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 13:09:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:00,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-12 13:09:00,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:09:00,896 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-12 13:09:00,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:09:00,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107601586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:00,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:09:00,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2022-07-12 13:09:00,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463455519] [2022-07-12 13:09:00,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:00,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:09:00,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:00,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:09:00,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-12 13:09:00,901 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-12 13:09:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:01,027 INFO L93 Difference]: Finished difference Result 2201 states and 2930 transitions. [2022-07-12 13:09:01,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:09:01,028 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-12 13:09:01,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:01,033 INFO L225 Difference]: With dead ends: 2201 [2022-07-12 13:09:01,033 INFO L226 Difference]: Without dead ends: 1301 [2022-07-12 13:09:01,035 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-12 13:09:01,035 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-12 13:09:01,035 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-12 13:09:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2022-07-12 13:09:01,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 939. [2022-07-12 13:09:01,090 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-12 13:09:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1227 transitions. [2022-07-12 13:09:01,093 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1227 transitions. Word has length 164 [2022-07-12 13:09:01,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:01,093 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1227 transitions. [2022-07-12 13:09:01,093 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-12 13:09:01,094 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1227 transitions. [2022-07-12 13:09:01,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-12 13:09:01,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:01,096 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-12 13:09:01,119 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-12 13:09:01,319 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-12 13:09:01,320 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:01,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:01,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1954792649, now seen corresponding path program 1 times [2022-07-12 13:09:01,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:01,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631008564] [2022-07-12 13:09:01,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:01,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:09:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 13:09:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:09:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 13:09:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:09:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 13:09:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 13:09:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 13:09:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 13:09:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,479 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-12 13:09:01,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:01,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631008564] [2022-07-12 13:09:01,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631008564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:09:01,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536343425] [2022-07-12 13:09:01,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:01,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:09:01,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:09:01,481 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:09:01,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 13:09:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:01,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 13:09:01,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:09:01,818 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-12 13:09:01,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:09:01,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536343425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:01,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:09:01,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-07-12 13:09:01,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372988736] [2022-07-12 13:09:01,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:01,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:09:01,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:01,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:09:01,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:09:01,819 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-12 13:09:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:01,904 INFO L93 Difference]: Finished difference Result 1879 states and 2467 transitions. [2022-07-12 13:09:01,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:09:01,905 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-12 13:09:01,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:01,908 INFO L225 Difference]: With dead ends: 1879 [2022-07-12 13:09:01,908 INFO L226 Difference]: Without dead ends: 959 [2022-07-12 13:09:01,910 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-12 13:09:01,911 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-12 13:09:01,911 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-12 13:09:01,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-07-12 13:09:01,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 947. [2022-07-12 13:09:01,959 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-12 13:09:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1235 transitions. [2022-07-12 13:09:01,966 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1235 transitions. Word has length 170 [2022-07-12 13:09:01,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:01,966 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1235 transitions. [2022-07-12 13:09:01,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 13:09:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1235 transitions. [2022-07-12 13:09:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-12 13:09:01,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:01,969 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-12 13:09:01,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 13:09:02,183 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-12 13:09:02,183 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:02,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:02,184 INFO L85 PathProgramCache]: Analyzing trace with hash -794500219, now seen corresponding path program 2 times [2022-07-12 13:09:02,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:02,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405127761] [2022-07-12 13:09:02,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:02,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:09:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:09:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 13:09:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:09:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 13:09:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:09:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:09:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 13:09:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 13:09:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:02,457 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-12 13:09:02,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:02,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405127761] [2022-07-12 13:09:02,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405127761] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:09:02,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127918802] [2022-07-12 13:09:02,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 13:09:02,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:09:02,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:09:02,459 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:09:02,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 13:09:02,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 13:09:02,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 13:09:02,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 13:09:02,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:09:02,784 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-12 13:09:02,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:09:02,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127918802] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:02,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:09:02,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2022-07-12 13:09:02,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544846365] [2022-07-12 13:09:02,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:02,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:09:02,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:02,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:09:02,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-12 13:09:02,787 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-12 13:09:03,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:03,035 INFO L93 Difference]: Finished difference Result 1933 states and 2603 transitions. [2022-07-12 13:09:03,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:09:03,035 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-12 13:09:03,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:03,040 INFO L225 Difference]: With dead ends: 1933 [2022-07-12 13:09:03,040 INFO L226 Difference]: Without dead ends: 1465 [2022-07-12 13:09:03,042 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-12 13:09:03,043 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-12 13:09:03,043 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-12 13:09:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2022-07-12 13:09:03,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 953. [2022-07-12 13:09:03,110 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-12 13:09:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1241 transitions. [2022-07-12 13:09:03,113 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1241 transitions. Word has length 176 [2022-07-12 13:09:03,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:03,113 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1241 transitions. [2022-07-12 13:09:03,113 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-12 13:09:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1241 transitions. [2022-07-12 13:09:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-12 13:09:03,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:03,115 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-12 13:09:03,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 13:09:03,336 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-12 13:09:03,336 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:03,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:03,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1273770335, now seen corresponding path program 1 times [2022-07-12 13:09:03,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:03,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180694853] [2022-07-12 13:09:03,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:03,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:09:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:09:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 13:09:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:09:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 13:09:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:09:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:09:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 13:09:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 13:09:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 13:09:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 13:09:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,542 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-12 13:09:03,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:03,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180694853] [2022-07-12 13:09:03,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180694853] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:09:03,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021811454] [2022-07-12 13:09:03,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:03,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:09:03,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:09:03,544 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:09:03,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 13:09:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:03,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 1804 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 13:09:03,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:09:04,066 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-12 13:09:04,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:09:04,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021811454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:04,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:09:04,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-12 13:09:04,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510003990] [2022-07-12 13:09:04,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:04,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 13:09:04,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:04,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 13:09:04,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:09:04,067 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-12 13:09:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:04,312 INFO L93 Difference]: Finished difference Result 2823 states and 3686 transitions. [2022-07-12 13:09:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 13:09:04,313 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-12 13:09:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:04,321 INFO L225 Difference]: With dead ends: 2823 [2022-07-12 13:09:04,321 INFO L226 Difference]: Without dead ends: 2815 [2022-07-12 13:09:04,322 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-12 13:09:04,322 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-12 13:09:04,323 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-12 13:09:04,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2022-07-12 13:09:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2801. [2022-07-12 13:09:04,488 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-12 13:09:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 3665 transitions. [2022-07-12 13:09:04,521 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 3665 transitions. Word has length 207 [2022-07-12 13:09:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:04,522 INFO L495 AbstractCegarLoop]: Abstraction has 2801 states and 3665 transitions. [2022-07-12 13:09:04,522 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-12 13:09:04,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 3665 transitions. [2022-07-12 13:09:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-12 13:09:04,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:04,526 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-12 13:09:04,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 13:09:04,739 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-12 13:09:04,740 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:04,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:04,740 INFO L85 PathProgramCache]: Analyzing trace with hash 262653085, now seen corresponding path program 1 times [2022-07-12 13:09:04,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:04,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079288065] [2022-07-12 13:09:04,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:04,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:09:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:09:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 13:09:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:09:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 13:09:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:09:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:09:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 13:09:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 13:09:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 13:09:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 13:09:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:04,896 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-12 13:09:04,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:04,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079288065] [2022-07-12 13:09:04,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079288065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:09:04,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:09:04,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 13:09:04,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688517541] [2022-07-12 13:09:04,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:09:04,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 13:09:04,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:09:04,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 13:09:04,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:09:04,898 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-12 13:09:05,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:09:05,808 INFO L93 Difference]: Finished difference Result 8991 states and 11824 transitions. [2022-07-12 13:09:05,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 13:09:05,809 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-12 13:09:05,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:09:05,831 INFO L225 Difference]: With dead ends: 8991 [2022-07-12 13:09:05,831 INFO L226 Difference]: Without dead ends: 6209 [2022-07-12 13:09:05,840 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-12 13:09:05,841 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-12 13:09:05,841 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-12 13:09:05,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6209 states. [2022-07-12 13:09:06,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6209 to 2813. [2022-07-12 13:09:06,080 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-12 13:09:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 3677 transitions. [2022-07-12 13:09:06,091 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 3677 transitions. Word has length 207 [2022-07-12 13:09:06,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:09:06,094 INFO L495 AbstractCegarLoop]: Abstraction has 2813 states and 3677 transitions. [2022-07-12 13:09:06,094 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-12 13:09:06,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3677 transitions. [2022-07-12 13:09:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-12 13:09:06,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:09:06,099 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-12 13:09:06,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 13:09:06,099 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:09:06,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:09:06,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1700386181, now seen corresponding path program 1 times [2022-07-12 13:09:06,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:09:06,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311982067] [2022-07-12 13:09:06,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:06,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:09:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:09:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:09:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:09:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:09:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 13:09:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:09:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 13:09:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:09:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:09:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:09:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:09:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 13:09:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 13:09:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 13:09:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 13:09:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 13:09:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,459 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-12 13:09:06,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:09:06,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311982067] [2022-07-12 13:09:06,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311982067] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:09:06,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275612603] [2022-07-12 13:09:06,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:09:06,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:09:06,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:09:06,460 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:09:06,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 13:09:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:09:06,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 1818 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-12 13:09:06,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:09:06,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 13:09:06,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-12 13:09:07,256 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-12 13:09:07,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 13:09:07,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:09:07,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:09:07,325 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 13:09:07,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 13:10:20,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:10:32,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:10:32,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:10:44,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:10:44,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:10:44,636 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-12 13:10:44,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:10:44,658 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-12 13:10:44,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275612603] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:10:44,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 13:10:44,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 31] total 41 [2022-07-12 13:10:44,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337984214] [2022-07-12 13:10:44,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 13:10:44,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-12 13:10:44,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:10:44,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-12 13:10:44,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1426, Unknown=9, NotChecked=154, Total=1722 [2022-07-12 13:10:44,673 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-12 13:12:06,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:12:06,628 INFO L93 Difference]: Finished difference Result 7649 states and 10194 transitions. [2022-07-12 13:12:06,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-12 13:12:06,629 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-12 13:12:06,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:12:06,655 INFO L225 Difference]: With dead ends: 7649 [2022-07-12 13:12:06,656 INFO L226 Difference]: Without dead ends: 4855 [2022-07-12 13:12:06,663 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-12 13:12:06,663 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 661 mSDsluCounter, 7631 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 8120 SdHoareTripleChecker+Invalid, 3187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1373 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 13:12:06,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 8120 Invalid, 3187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1608 Invalid, 0 Unknown, 1373 Unchecked, 0.9s Time] [2022-07-12 13:12:06,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4855 states. [2022-07-12 13:12:06,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4855 to 3317. [2022-07-12 13:12:06,896 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-12 13:12:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4348 transitions. [2022-07-12 13:12:06,905 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4348 transitions. Word has length 214 [2022-07-12 13:12:06,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:12:06,905 INFO L495 AbstractCegarLoop]: Abstraction has 3317 states and 4348 transitions. [2022-07-12 13:12:06,906 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-12 13:12:06,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4348 transitions. [2022-07-12 13:12:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-07-12 13:12:06,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:12:06,911 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:12:06,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 13:12:07,132 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-12 13:12:07,132 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:12:07,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:12:07,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1803165317, now seen corresponding path program 2 times [2022-07-12 13:12:07,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:12:07,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178772187] [2022-07-12 13:12:07,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:12:07,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:12:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:12:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 13:12:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:12:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:12:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:12:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 13:12:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:12:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:12:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 13:12:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:12:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 13:12:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:12:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 13:12:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 13:12:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 13:12:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 13:12:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-12 13:12:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-12 13:12:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:07,377 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-12 13:12:07,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:12:07,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178772187] [2022-07-12 13:12:07,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178772187] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:12:07,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562524210] [2022-07-12 13:12:07,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 13:12:07,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:12:07,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:12:07,379 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:12:07,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 13:12:07,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 13:12:07,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 13:12:07,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 1870 conjuncts, 150 conjunts are in the unsatisfiable core [2022-07-12 13:12:07,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:12:07,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 13:12:07,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-12 13:12:08,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 13:12:08,046 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1324 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1324))) is different from true [2022-07-12 13:12:08,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 13:12:08,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 13:12:08,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:12:08,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:12:08,125 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 13:12:08,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 13:12:08,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 13:12:12,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 13:12:12,369 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 13:12:12,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 13:12:12,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 13:12:16,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 13:12:17,087 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-12 13:12:17,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-12 13:12:17,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-12 13:12:43,528 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-12 13:12:43,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 13:12:53,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:13:03,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:13:03,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:13:14,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:13:14,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 13:13:14,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-07-12 13:13:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 44 proven. 86 refuted. 0 times theorem prover too weak. 29 trivial. 2 not checked. [2022-07-12 13:13:14,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:13:14,268 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1337 (Array Int Int)) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1337) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)))) is different from false [2022-07-12 13:13:14,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562524210] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:13:14,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 13:13:14,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 45] total 52 [2022-07-12 13:13:14,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342267546] [2022-07-12 13:13:14,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 13:13:14,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-12 13:13:14,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:13:14,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-12 13:13:14,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=2611, Unknown=22, NotChecked=210, Total=3080 [2022-07-12 13:13:14,284 INFO L87 Difference]: Start difference. First operand 3317 states and 4348 transitions. Second operand has 52 states, 48 states have (on average 5.333333333333333) internal successors, (256), 38 states have internal predecessors, (256), 15 states have call successors, (41), 13 states have call predecessors, (41), 15 states have return successors, (41), 18 states have call predecessors, (41), 15 states have call successors, (41)