./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a45fd6cc499457b8646fc297298cfc21cc57c7198001d9ae53614774c0beef98 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 01:33:44,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 01:33:44,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 01:33:44,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 01:33:44,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 01:33:44,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 01:33:44,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 01:33:44,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 01:33:44,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 01:33:44,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 01:33:44,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 01:33:44,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 01:33:44,425 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 01:33:44,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 01:33:44,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 01:33:44,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 01:33:44,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 01:33:44,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 01:33:44,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 01:33:44,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 01:33:44,434 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 01:33:44,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 01:33:44,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 01:33:44,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 01:33:44,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 01:33:44,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 01:33:44,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 01:33:44,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 01:33:44,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 01:33:44,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 01:33:44,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 01:33:44,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 01:33:44,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 01:33:44,445 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 01:33:44,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 01:33:44,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 01:33:44,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 01:33:44,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 01:33:44,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 01:33:44,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 01:33:44,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 01:33:44,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 01:33:44,457 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 01:33:44,483 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 01:33:44,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 01:33:44,484 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 01:33:44,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 01:33:44,485 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 01:33:44,486 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 01:33:44,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 01:33:44,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 01:33:44,486 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 01:33:44,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 01:33:44,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 01:33:44,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 01:33:44,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 01:33:44,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 01:33:44,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 01:33:44,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 01:33:44,489 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 01:33:44,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 01:33:44,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 01:33:44,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 01:33:44,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 01:33:44,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 01:33:44,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 01:33:44,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 01:33:44,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 01:33:44,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 01:33:44,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 01:33:44,492 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 01:33:44,492 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 01:33:44,493 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 01:33:44,493 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 -> a45fd6cc499457b8646fc297298cfc21cc57c7198001d9ae53614774c0beef98 [2022-07-20 01:33:44,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 01:33:44,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 01:33:44,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 01:33:44,725 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 01:33:44,726 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 01:33:44,727 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i [2022-07-20 01:33:44,807 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b90c4e3b/118a106418b044d19490faa3da85bef0/FLAG1fd698d4a [2022-07-20 01:33:45,556 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 01:33:45,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i [2022-07-20 01:33:45,602 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b90c4e3b/118a106418b044d19490faa3da85bef0/FLAG1fd698d4a [2022-07-20 01:33:45,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b90c4e3b/118a106418b044d19490faa3da85bef0 [2022-07-20 01:33:45,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 01:33:45,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 01:33:45,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 01:33:45,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 01:33:45,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 01:33:45,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:33:45" (1/1) ... [2022-07-20 01:33:45,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a8c910c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:33:45, skipping insertion in model container [2022-07-20 01:33:45,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:33:45" (1/1) ... [2022-07-20 01:33:45,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 01:33:45,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 01:33:47,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i[318493,318506] [2022-07-20 01:33:47,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 01:33:47,864 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 01:33:48,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i[318493,318506] [2022-07-20 01:33:48,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 01:33:48,351 INFO L208 MainTranslator]: Completed translation [2022-07-20 01:33:48,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:33:48 WrapperNode [2022-07-20 01:33:48,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 01:33:48,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 01:33:48,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 01:33:48,355 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 01:33:48,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:33:48" (1/1) ... [2022-07-20 01:33:48,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:33:48" (1/1) ... [2022-07-20 01:33:48,650 INFO L137 Inliner]: procedures = 311, calls = 1623, calls flagged for inlining = 133, calls inlined = 130, statements flattened = 4354 [2022-07-20 01:33:48,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 01:33:48,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 01:33:48,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 01:33:48,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 01:33:48,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:33:48" (1/1) ... [2022-07-20 01:33:48,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:33:48" (1/1) ... [2022-07-20 01:33:48,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:33:48" (1/1) ... [2022-07-20 01:33:48,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:33:48" (1/1) ... [2022-07-20 01:33:48,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:33:48" (1/1) ... [2022-07-20 01:33:48,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:33:48" (1/1) ... [2022-07-20 01:33:48,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:33:48" (1/1) ... [2022-07-20 01:33:48,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 01:33:48,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 01:33:48,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 01:33:48,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 01:33:48,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:33:48" (1/1) ... [2022-07-20 01:33:48,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 01:33:48,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 01:33:48,865 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-20 01:33:48,886 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-20 01:33:48,904 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-20 01:33:48,904 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-20 01:33:48,905 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_cpu_to_dev32 [2022-07-20 01:33:48,905 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_cpu_to_dev32 [2022-07-20 01:33:48,905 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-20 01:33:48,905 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-20 01:33:48,905 INFO L130 BoogieDeclarations]: Found specification of procedure put_rx_struct [2022-07-20 01:33:48,905 INFO L138 BoogieDeclarations]: Found implementation of procedure put_rx_struct [2022-07-20 01:33:48,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-20 01:33:48,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-20 01:33:48,906 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_netif_rx [2022-07-20 01:33:48,906 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_netif_rx [2022-07-20 01:33:48,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 01:33:48,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 01:33:48,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-20 01:33:48,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-20 01:33:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-07-20 01:33:48,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-07-20 01:33:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 01:33:48,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 01:33:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2022-07-20 01:33:48,907 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2022-07-20 01:33:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_size_call_parameter [2022-07-20 01:33:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_1 [2022-07-20 01:33:48,908 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_1 [2022-07-20 01:33:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_cpu_to_dev16 [2022-07-20 01:33:48,908 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_cpu_to_dev16 [2022-07-20 01:33:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_dev16_to_cpu [2022-07-20 01:33:48,908 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_dev16_to_cpu [2022-07-20 01:33:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_stats [2022-07-20 01:33:48,909 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_stats [2022-07-20 01:33:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure free_rx_struct [2022-07-20 01:33:48,909 INFO L138 BoogieDeclarations]: Found implementation of procedure free_rx_struct [2022-07-20 01:33:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-20 01:33:48,909 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-20 01:33:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-20 01:33:48,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-20 01:33:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-20 01:33:48,910 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-20 01:33:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-20 01:33:48,910 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-20 01:33:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-20 01:33:48,911 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-20 01:33:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-20 01:33:48,911 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-20 01:33:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_set_config [2022-07-20 01:33:48,912 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_set_config [2022-07-20 01:33:48,912 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_set_endian [2022-07-20 01:33:48,912 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_set_endian [2022-07-20 01:33:48,912 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-20 01:33:48,912 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-20 01:33:48,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 01:33:48,912 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-20 01:33:48,913 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-20 01:33:48,913 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-20 01:33:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_resume [2022-07-20 01:33:48,914 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_resume [2022-07-20 01:33:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 01:33:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_rx [2022-07-20 01:33:48,950 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_rx [2022-07-20 01:33:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure free_tx_sdu_struct [2022-07-20 01:33:48,950 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tx_sdu_struct [2022-07-20 01:33:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_1 [2022-07-20 01:33:48,950 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_1 [2022-07-20 01:33:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-20 01:33:48,950 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-20 01:33:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 01:33:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 01:33:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-20 01:33:48,951 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-20 01:33:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2022-07-20 01:33:48,951 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2022-07-20 01:33:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-20 01:33:48,951 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-20 01:33:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-20 01:33:48,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-20 01:33:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-20 01:33:48,951 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-20 01:33:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-20 01:33:48,951 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-20 01:33:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-07-20 01:33:48,952 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-07-20 01:33:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure packet_aggregation [2022-07-20 01:33:48,952 INFO L138 BoogieDeclarations]: Found implementation of procedure packet_aggregation [2022-07-20 01:33:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_tx_struct [2022-07-20 01:33:48,952 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_tx_struct [2022-07-20 01:33:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2022-07-20 01:33:48,952 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2022-07-20 01:33:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure find_dev_index [2022-07-20 01:33:48,952 INFO L138 BoogieDeclarations]: Found implementation of procedure find_dev_index [2022-07-20 01:33:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-20 01:33:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-20 01:33:48,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-20 01:33:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-07-20 01:33:48,953 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-07-20 01:33:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 01:33:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure do_tx [2022-07-20 01:33:48,953 INFO L138 BoogieDeclarations]: Found implementation of procedure do_tx [2022-07-20 01:33:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-07-20 01:33:48,953 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-07-20 01:33:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mark_last_busy [2022-07-20 01:33:48,953 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mark_last_busy [2022-07-20 01:33:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 01:33:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_has_listeners [2022-07-20 01:33:48,953 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_has_listeners [2022-07-20 01:33:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-20 01:33:48,954 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-20 01:33:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-20 01:33:48,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-20 01:33:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure ether_addr_copy [2022-07-20 01:33:48,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ether_addr_copy [2022-07-20 01:33:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-20 01:33:48,954 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-20 01:33:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-20 01:33:48,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-20 01:33:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_send_complete [2022-07-20 01:33:48,954 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_send_complete [2022-07-20 01:33:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-20 01:33:48,954 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-20 01:33:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure ether_setup [2022-07-20 01:33:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-20 01:33:48,955 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-20 01:33:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 01:33:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-07-20 01:33:48,955 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-07-20 01:33:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-07-20 01:33:48,955 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-07-20 01:33:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-20 01:33:48,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-20 01:33:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_disconnect [2022-07-20 01:33:48,955 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_disconnect [2022-07-20 01:33:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 01:33:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-07-20 01:33:48,956 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-07-20 01:33:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 01:33:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_recv [2022-07-20 01:33:48,956 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_recv [2022-07-20 01:33:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 01:33:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-20 01:33:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 01:33:48,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 01:33:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_lte_device [2022-07-20 01:33:48,956 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_lte_device [2022-07-20 01:33:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-20 01:33:48,957 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-20 01:33:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-20 01:33:48,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-20 01:33:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-07-20 01:33:48,957 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-07-20 01:33:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2022-07-20 01:33:48,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2022-07-20 01:33:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_1 [2022-07-20 01:33:48,957 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_1 [2022-07-20 01:33:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure free_tx_struct [2022-07-20 01:33:48,957 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tx_struct [2022-07-20 01:33:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2022-07-20 01:33:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2022-07-20 01:33:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-07-20 01:33:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-07-20 01:33:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_dev32_to_cpu [2022-07-20 01:33:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_dev32_to_cpu [2022-07-20 01:33:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-20 01:33:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-20 01:33:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure do_rx [2022-07-20 01:33:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure do_rx [2022-07-20 01:33:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 01:33:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-07-20 01:33:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-07-20 01:33:48,959 INFO L130 BoogieDeclarations]: Found specification of procedure release_usb [2022-07-20 01:33:48,959 INFO L138 BoogieDeclarations]: Found implementation of procedure release_usb [2022-07-20 01:33:48,959 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-07-20 01:33:48,959 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-07-20 01:33:48,961 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-20 01:33:48,961 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-20 01:33:48,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 01:33:48,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 01:33:49,730 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 01:33:49,733 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 01:33:49,993 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 01:33:52,607 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 01:33:52,627 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 01:33:52,628 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 01:33:52,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 01:33:52 BoogieIcfgContainer [2022-07-20 01:33:52,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 01:33:52,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 01:33:52,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 01:33:52,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 01:33:52,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 01:33:45" (1/3) ... [2022-07-20 01:33:52,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdff20a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 01:33:52, skipping insertion in model container [2022-07-20 01:33:52,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:33:48" (2/3) ... [2022-07-20 01:33:52,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdff20a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 01:33:52, skipping insertion in model container [2022-07-20 01:33:52,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 01:33:52" (3/3) ... [2022-07-20 01:33:52,641 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i [2022-07-20 01:33:52,654 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 01:33:52,654 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 01:33:52,747 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 01:33:52,755 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@c9caa10, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d8880d3 [2022-07-20 01:33:52,755 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 01:33:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 1526 states, 1043 states have (on average 1.3883029721955897) internal successors, (1448), 1083 states have internal predecessors, (1448), 404 states have call successors, (404), 78 states have call predecessors, (404), 77 states have return successors, (398), 388 states have call predecessors, (398), 398 states have call successors, (398) [2022-07-20 01:33:52,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 01:33:52,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 01:33:52,790 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 01:33:52,791 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 01:33:52,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 01:33:52,796 INFO L85 PathProgramCache]: Analyzing trace with hash 537382679, now seen corresponding path program 1 times [2022-07-20 01:33:52,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 01:33:52,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690664157] [2022-07-20 01:33:52,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 01:33:52,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 01:33:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:33:53,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 01:33:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:33:53,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:33:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:33:53,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:33:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:33:53,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 01:33:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:33:53,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 01:33:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:33:53,486 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-20 01:33:53,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 01:33:53,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690664157] [2022-07-20 01:33:53,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690664157] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 01:33:53,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 01:33:53,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 01:33:53,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251050330] [2022-07-20 01:33:53,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 01:33:53,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 01:33:53,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 01:33:53,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 01:33:53,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 01:33:53,543 INFO L87 Difference]: Start difference. First operand has 1526 states, 1043 states have (on average 1.3883029721955897) internal successors, (1448), 1083 states have internal predecessors, (1448), 404 states have call successors, (404), 78 states have call predecessors, (404), 77 states have return successors, (398), 388 states have call predecessors, (398), 398 states have call successors, (398) Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 01:33:57,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 01:33:57,919 INFO L93 Difference]: Finished difference Result 3355 states and 5176 transitions. [2022-07-20 01:33:57,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 01:33:57,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2022-07-20 01:33:57,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 01:33:57,961 INFO L225 Difference]: With dead ends: 3355 [2022-07-20 01:33:57,961 INFO L226 Difference]: Without dead ends: 1818 [2022-07-20 01:33:57,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-20 01:33:57,991 INFO L413 NwaCegarLoop]: 2127 mSDtfsCounter, 1041 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 1165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 4137 SdHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1165 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-20 01:33:57,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 4137 Invalid, 2540 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1165 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-20 01:33:58,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2022-07-20 01:33:58,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1510. [2022-07-20 01:33:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1035 states have (on average 1.3371980676328503) internal successors, (1384), 1068 states have internal predecessors, (1384), 398 states have call successors, (398), 77 states have call predecessors, (398), 76 states have return successors, (396), 386 states have call predecessors, (396), 396 states have call successors, (396) [2022-07-20 01:33:58,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2178 transitions. [2022-07-20 01:33:58,191 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2178 transitions. Word has length 49 [2022-07-20 01:33:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 01:33:58,192 INFO L495 AbstractCegarLoop]: Abstraction has 1510 states and 2178 transitions. [2022-07-20 01:33:58,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 01:33:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2178 transitions. [2022-07-20 01:33:58,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 01:33:58,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 01:33:58,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 01:33:58,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 01:33:58,203 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 01:33:58,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 01:33:58,204 INFO L85 PathProgramCache]: Analyzing trace with hash -491976619, now seen corresponding path program 1 times [2022-07-20 01:33:58,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 01:33:58,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805635753] [2022-07-20 01:33:58,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 01:33:58,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 01:33:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:33:58,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 01:33:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:33:58,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:33:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:33:58,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:33:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:33:58,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 01:33:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:33:58,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 01:33:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:33:58,392 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-20 01:33:58,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 01:33:58,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805635753] [2022-07-20 01:33:58,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805635753] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 01:33:58,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 01:33:58,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 01:33:58,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440650348] [2022-07-20 01:33:58,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 01:33:58,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 01:33:58,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 01:33:58,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 01:33:58,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 01:33:58,395 INFO L87 Difference]: Start difference. First operand 1510 states and 2178 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 01:34:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 01:34:04,346 INFO L93 Difference]: Finished difference Result 4855 states and 7262 transitions. [2022-07-20 01:34:04,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 01:34:04,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2022-07-20 01:34:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 01:34:04,367 INFO L225 Difference]: With dead ends: 4855 [2022-07-20 01:34:04,368 INFO L226 Difference]: Without dead ends: 3355 [2022-07-20 01:34:04,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-20 01:34:04,376 INFO L413 NwaCegarLoop]: 2641 mSDtfsCounter, 4528 mSDsluCounter, 2694 mSDsCounter, 0 mSdLazyCounter, 2213 mSolverCounterSat, 3348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4789 SdHoareTripleChecker+Valid, 5335 SdHoareTripleChecker+Invalid, 5561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3348 IncrementalHoareTripleChecker+Valid, 2213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-20 01:34:04,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4789 Valid, 5335 Invalid, 5561 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3348 Valid, 2213 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-20 01:34:04,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2022-07-20 01:34:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 2745. [2022-07-20 01:34:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2745 states, 1895 states have (on average 1.341424802110818) internal successors, (2542), 1952 states have internal predecessors, (2542), 710 states have call successors, (710), 140 states have call predecessors, (710), 139 states have return successors, (708), 689 states have call predecessors, (708), 708 states have call successors, (708) [2022-07-20 01:34:04,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2745 states and 3960 transitions. [2022-07-20 01:34:04,500 INFO L78 Accepts]: Start accepts. Automaton has 2745 states and 3960 transitions. Word has length 49 [2022-07-20 01:34:04,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 01:34:04,501 INFO L495 AbstractCegarLoop]: Abstraction has 2745 states and 3960 transitions. [2022-07-20 01:34:04,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 01:34:04,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 3960 transitions. [2022-07-20 01:34:04,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-20 01:34:04,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 01:34:04,506 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 01:34:04,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 01:34:04,507 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 01:34:04,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 01:34:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash -305469456, now seen corresponding path program 1 times [2022-07-20 01:34:04,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 01:34:04,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976326342] [2022-07-20 01:34:04,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 01:34:04,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 01:34:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:04,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 01:34:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:04,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:34:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:04,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:34:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:04,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 01:34:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:04,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-20 01:34:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:04,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 01:34:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:04,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-20 01:34:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 01:34:04,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 01:34:04,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976326342] [2022-07-20 01:34:04,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976326342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 01:34:04,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 01:34:04,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 01:34:04,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284701164] [2022-07-20 01:34:04,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 01:34:04,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 01:34:04,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 01:34:04,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 01:34:04,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 01:34:04,794 INFO L87 Difference]: Start difference. First operand 2745 states and 3960 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-20 01:34:14,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 01:34:14,758 INFO L93 Difference]: Finished difference Result 9823 states and 14952 transitions. [2022-07-20 01:34:14,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 01:34:14,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-07-20 01:34:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 01:34:14,818 INFO L225 Difference]: With dead ends: 9823 [2022-07-20 01:34:14,818 INFO L226 Difference]: Without dead ends: 7088 [2022-07-20 01:34:14,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-20 01:34:14,840 INFO L413 NwaCegarLoop]: 2189 mSDtfsCounter, 5702 mSDsluCounter, 4679 mSDsCounter, 0 mSdLazyCounter, 5466 mSolverCounterSat, 4299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6074 SdHoareTripleChecker+Valid, 6868 SdHoareTripleChecker+Invalid, 9765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4299 IncrementalHoareTripleChecker+Valid, 5466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-07-20 01:34:14,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6074 Valid, 6868 Invalid, 9765 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4299 Valid, 5466 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-07-20 01:34:14,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2022-07-20 01:34:15,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 5665. [2022-07-20 01:34:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5665 states, 3946 states have (on average 1.3563101875316776) internal successors, (5352), 4067 states have internal predecessors, (5352), 1427 states have call successors, (1427), 279 states have call predecessors, (1427), 291 states have return successors, (1511), 1395 states have call predecessors, (1511), 1424 states have call successors, (1511) [2022-07-20 01:34:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5665 states to 5665 states and 8290 transitions. [2022-07-20 01:34:15,223 INFO L78 Accepts]: Start accepts. Automaton has 5665 states and 8290 transitions. Word has length 69 [2022-07-20 01:34:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 01:34:15,225 INFO L495 AbstractCegarLoop]: Abstraction has 5665 states and 8290 transitions. [2022-07-20 01:34:15,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-20 01:34:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 5665 states and 8290 transitions. [2022-07-20 01:34:15,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-20 01:34:15,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 01:34:15,229 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 01:34:15,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 01:34:15,229 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 01:34:15,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 01:34:15,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1392904398, now seen corresponding path program 1 times [2022-07-20 01:34:15,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 01:34:15,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333886678] [2022-07-20 01:34:15,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 01:34:15,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 01:34:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:15,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 01:34:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:15,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:34:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:15,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:34:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:15,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 01:34:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:15,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 01:34:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:15,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 01:34:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:15,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 01:34:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:15,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 01:34:15,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 01:34:15,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333886678] [2022-07-20 01:34:15,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333886678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 01:34:15,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 01:34:15,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 01:34:15,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664652159] [2022-07-20 01:34:15,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 01:34:15,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 01:34:15,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 01:34:15,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 01:34:15,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 01:34:15,517 INFO L87 Difference]: Start difference. First operand 5665 states and 8290 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-20 01:34:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 01:34:23,829 INFO L93 Difference]: Finished difference Result 16076 states and 24448 transitions. [2022-07-20 01:34:23,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 01:34:23,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-07-20 01:34:23,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 01:34:23,898 INFO L225 Difference]: With dead ends: 16076 [2022-07-20 01:34:23,898 INFO L226 Difference]: Without dead ends: 10421 [2022-07-20 01:34:23,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-20 01:34:23,930 INFO L413 NwaCegarLoop]: 2167 mSDtfsCounter, 6187 mSDsluCounter, 3665 mSDsCounter, 0 mSdLazyCounter, 4438 mSolverCounterSat, 4454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6559 SdHoareTripleChecker+Valid, 5832 SdHoareTripleChecker+Invalid, 8892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4454 IncrementalHoareTripleChecker+Valid, 4438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-07-20 01:34:23,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6559 Valid, 5832 Invalid, 8892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4454 Valid, 4438 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-07-20 01:34:23,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10421 states. [2022-07-20 01:34:24,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10421 to 8539. [2022-07-20 01:34:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8539 states, 5967 states have (on average 1.3616557734204793) internal successors, (8125), 6156 states have internal predecessors, (8125), 2132 states have call successors, (2132), 418 states have call predecessors, (2132), 439 states have return successors, (2313), 2079 states have call predecessors, (2313), 2128 states have call successors, (2313) [2022-07-20 01:34:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8539 states to 8539 states and 12570 transitions. [2022-07-20 01:34:24,405 INFO L78 Accepts]: Start accepts. Automaton has 8539 states and 12570 transitions. Word has length 68 [2022-07-20 01:34:24,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 01:34:24,406 INFO L495 AbstractCegarLoop]: Abstraction has 8539 states and 12570 transitions. [2022-07-20 01:34:24,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-20 01:34:24,407 INFO L276 IsEmpty]: Start isEmpty. Operand 8539 states and 12570 transitions. [2022-07-20 01:34:24,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-20 01:34:24,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 01:34:24,411 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 01:34:24,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 01:34:24,411 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 01:34:24,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 01:34:24,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1859013993, now seen corresponding path program 1 times [2022-07-20 01:34:24,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 01:34:24,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790641263] [2022-07-20 01:34:24,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 01:34:24,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 01:34:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:24,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 01:34:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:24,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:34:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:24,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:34:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:24,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 01:34:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:24,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 01:34:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:24,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 01:34:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:24,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 01:34:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 01:34:24,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 01:34:24,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790641263] [2022-07-20 01:34:24,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790641263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 01:34:24,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 01:34:24,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 01:34:24,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830990811] [2022-07-20 01:34:24,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 01:34:24,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 01:34:24,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 01:34:24,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 01:34:24,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 01:34:24,627 INFO L87 Difference]: Start difference. First operand 8539 states and 12570 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-20 01:34:33,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 01:34:33,447 INFO L93 Difference]: Finished difference Result 22466 states and 34338 transitions. [2022-07-20 01:34:33,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 01:34:33,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2022-07-20 01:34:33,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 01:34:33,545 INFO L225 Difference]: With dead ends: 22466 [2022-07-20 01:34:33,545 INFO L226 Difference]: Without dead ends: 13937 [2022-07-20 01:34:33,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-20 01:34:33,591 INFO L413 NwaCegarLoop]: 2299 mSDtfsCounter, 5463 mSDsluCounter, 4651 mSDsCounter, 0 mSdLazyCounter, 5420 mSolverCounterSat, 4302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5841 SdHoareTripleChecker+Valid, 6950 SdHoareTripleChecker+Invalid, 9722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4302 IncrementalHoareTripleChecker+Valid, 5420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-07-20 01:34:33,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5841 Valid, 6950 Invalid, 9722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4302 Valid, 5420 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2022-07-20 01:34:33,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13937 states. [2022-07-20 01:34:34,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13937 to 11447. [2022-07-20 01:34:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11447 states, 8012 states have (on average 1.3635796305541688) internal successors, (10925), 8267 states have internal predecessors, (10925), 2843 states have call successors, (2843), 557 states have call predecessors, (2843), 591 states have return successors, (3148), 2777 states have call predecessors, (3148), 2838 states have call successors, (3148) [2022-07-20 01:34:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11447 states to 11447 states and 16916 transitions. [2022-07-20 01:34:34,213 INFO L78 Accepts]: Start accepts. Automaton has 11447 states and 16916 transitions. Word has length 70 [2022-07-20 01:34:34,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 01:34:34,213 INFO L495 AbstractCegarLoop]: Abstraction has 11447 states and 16916 transitions. [2022-07-20 01:34:34,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-20 01:34:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand 11447 states and 16916 transitions. [2022-07-20 01:34:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-20 01:34:34,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 01:34:34,216 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 01:34:34,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 01:34:34,216 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 01:34:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 01:34:34,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1077150297, now seen corresponding path program 1 times [2022-07-20 01:34:34,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 01:34:34,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005470173] [2022-07-20 01:34:34,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 01:34:34,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 01:34:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:34,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 01:34:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:34,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:34:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:34,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:34:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:34,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 01:34:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:34,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 01:34:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:34,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 01:34:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:34,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 01:34:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 01:34:34,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 01:34:34,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005470173] [2022-07-20 01:34:34,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005470173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 01:34:34,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 01:34:34,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 01:34:34,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584258784] [2022-07-20 01:34:34,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 01:34:34,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 01:34:34,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 01:34:34,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 01:34:34,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 01:34:34,427 INFO L87 Difference]: Start difference. First operand 11447 states and 16916 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-20 01:34:40,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 01:34:40,716 INFO L93 Difference]: Finished difference Result 27908 states and 42487 transitions. [2022-07-20 01:34:40,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 01:34:40,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2022-07-20 01:34:40,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 01:34:40,788 INFO L225 Difference]: With dead ends: 27908 [2022-07-20 01:34:40,789 INFO L226 Difference]: Without dead ends: 16427 [2022-07-20 01:34:40,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-20 01:34:40,826 INFO L413 NwaCegarLoop]: 2300 mSDtfsCounter, 6933 mSDsluCounter, 3066 mSDsCounter, 0 mSdLazyCounter, 3584 mSolverCounterSat, 5659 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7304 SdHoareTripleChecker+Valid, 5366 SdHoareTripleChecker+Invalid, 9243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5659 IncrementalHoareTripleChecker+Valid, 3584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-20 01:34:40,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7304 Valid, 5366 Invalid, 9243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5659 Valid, 3584 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-20 01:34:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16427 states. [2022-07-20 01:34:41,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16427 to 13502. [2022-07-20 01:34:41,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13502 states, 9434 states have (on average 1.3522365910536358) internal successors, (12757), 9706 states have internal predecessors, (12757), 3363 states have call successors, (3363), 669 states have call predecessors, (3363), 704 states have return successors, (3683), 3298 states have call predecessors, (3683), 3358 states have call successors, (3683) [2022-07-20 01:34:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13502 states to 13502 states and 19803 transitions. [2022-07-20 01:34:41,594 INFO L78 Accepts]: Start accepts. Automaton has 13502 states and 19803 transitions. Word has length 71 [2022-07-20 01:34:41,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 01:34:41,596 INFO L495 AbstractCegarLoop]: Abstraction has 13502 states and 19803 transitions. [2022-07-20 01:34:41,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-20 01:34:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 13502 states and 19803 transitions. [2022-07-20 01:34:41,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-20 01:34:41,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 01:34:41,599 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 01:34:41,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 01:34:41,599 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 01:34:41,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 01:34:41,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1015390489, now seen corresponding path program 1 times [2022-07-20 01:34:41,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 01:34:41,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048754578] [2022-07-20 01:34:41,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 01:34:41,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 01:34:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:41,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 01:34:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:41,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:34:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:41,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:34:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:41,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 01:34:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:41,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 01:34:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:41,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:34:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:41,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:34:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:41,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 01:34:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-20 01:34:41,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 01:34:41,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048754578] [2022-07-20 01:34:41,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048754578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 01:34:41,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 01:34:41,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 01:34:41,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047404284] [2022-07-20 01:34:41,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 01:34:41,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 01:34:41,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 01:34:41,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 01:34:41,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 01:34:41,818 INFO L87 Difference]: Start difference. First operand 13502 states and 19803 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-20 01:34:44,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 01:34:44,831 INFO L93 Difference]: Finished difference Result 16802 states and 25517 transitions. [2022-07-20 01:34:44,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 01:34:44,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 86 [2022-07-20 01:34:44,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 01:34:44,917 INFO L225 Difference]: With dead ends: 16802 [2022-07-20 01:34:44,918 INFO L226 Difference]: Without dead ends: 16799 [2022-07-20 01:34:44,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-20 01:34:44,931 INFO L413 NwaCegarLoop]: 2137 mSDtfsCounter, 3466 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 2200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3680 SdHoareTripleChecker+Valid, 3402 SdHoareTripleChecker+Invalid, 3370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2200 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-20 01:34:44,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3680 Valid, 3402 Invalid, 3370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2200 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-20 01:34:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16799 states. [2022-07-20 01:34:45,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16799 to 13987. [2022-07-20 01:34:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13987 states, 9744 states have (on average 1.3473932676518883) internal successors, (13129), 10032 states have internal predecessors, (13129), 3467 states have call successors, (3467), 740 states have call predecessors, (3467), 775 states have return successors, (3787), 3402 states have call predecessors, (3787), 3462 states have call successors, (3787) [2022-07-20 01:34:45,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13987 states to 13987 states and 20383 transitions. [2022-07-20 01:34:45,734 INFO L78 Accepts]: Start accepts. Automaton has 13987 states and 20383 transitions. Word has length 86 [2022-07-20 01:34:45,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 01:34:45,735 INFO L495 AbstractCegarLoop]: Abstraction has 13987 states and 20383 transitions. [2022-07-20 01:34:45,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-20 01:34:45,735 INFO L276 IsEmpty]: Start isEmpty. Operand 13987 states and 20383 transitions. [2022-07-20 01:34:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-20 01:34:45,750 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 01:34:45,750 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 01:34:45,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 01:34:45,751 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 01:34:45,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 01:34:45,753 INFO L85 PathProgramCache]: Analyzing trace with hash -565835672, now seen corresponding path program 1 times [2022-07-20 01:34:45,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 01:34:45,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086266302] [2022-07-20 01:34:45,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 01:34:45,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 01:34:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:45,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 01:34:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:45,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:34:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:45,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:34:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:45,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 01:34:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:45,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 01:34:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:45,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:34:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:45,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:34:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:45,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-20 01:34:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:46,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:34:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:46,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 01:34:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:46,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 01:34:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:46,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 01:34:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:46,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 01:34:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:46,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:34:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:46,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:34:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:46,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 01:34:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:46,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-20 01:34:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:46,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-20 01:34:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:46,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 01:34:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:46,097 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-20 01:34:46,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 01:34:46,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086266302] [2022-07-20 01:34:46,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086266302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 01:34:46,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 01:34:46,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 01:34:46,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940191305] [2022-07-20 01:34:46,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 01:34:46,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 01:34:46,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 01:34:46,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 01:34:46,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-20 01:34:46,100 INFO L87 Difference]: Start difference. First operand 13987 states and 20383 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (22), 8 states have call predecessors, (22), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-20 01:34:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 01:34:56,454 INFO L93 Difference]: Finished difference Result 40146 states and 60650 transitions. [2022-07-20 01:34:56,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 01:34:56,454 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (22), 8 states have call predecessors, (22), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 173 [2022-07-20 01:34:56,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 01:34:56,592 INFO L225 Difference]: With dead ends: 40146 [2022-07-20 01:34:56,592 INFO L226 Difference]: Without dead ends: 26169 [2022-07-20 01:34:56,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2022-07-20 01:34:56,646 INFO L413 NwaCegarLoop]: 3305 mSDtfsCounter, 6184 mSDsluCounter, 5456 mSDsCounter, 0 mSdLazyCounter, 5103 mSolverCounterSat, 5926 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6541 SdHoareTripleChecker+Valid, 8761 SdHoareTripleChecker+Invalid, 11029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5926 IncrementalHoareTripleChecker+Valid, 5103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-07-20 01:34:56,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6541 Valid, 8761 Invalid, 11029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5926 Valid, 5103 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2022-07-20 01:34:56,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26169 states. [2022-07-20 01:34:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26169 to 20775. [2022-07-20 01:34:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20775 states, 14493 states have (on average 1.3469951010832817) internal successors, (19522), 14905 states have internal predecessors, (19522), 5154 states have call successors, (5154), 1079 states have call predecessors, (5154), 1127 states have return successors, (5608), 5069 states have call predecessors, (5608), 5149 states have call successors, (5608) [2022-07-20 01:34:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20775 states to 20775 states and 30284 transitions. [2022-07-20 01:34:58,099 INFO L78 Accepts]: Start accepts. Automaton has 20775 states and 30284 transitions. Word has length 173 [2022-07-20 01:34:58,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 01:34:58,101 INFO L495 AbstractCegarLoop]: Abstraction has 20775 states and 30284 transitions. [2022-07-20 01:34:58,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (22), 8 states have call predecessors, (22), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-20 01:34:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 20775 states and 30284 transitions. [2022-07-20 01:34:58,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-20 01:34:58,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 01:34:58,113 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 01:34:58,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 01:34:58,114 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 01:34:58,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 01:34:58,114 INFO L85 PathProgramCache]: Analyzing trace with hash 684186662, now seen corresponding path program 1 times [2022-07-20 01:34:58,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 01:34:58,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270954336] [2022-07-20 01:34:58,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 01:34:58,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 01:34:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 01:34:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:34:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:34:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 01:34:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 01:34:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:34:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:34:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 01:34:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 01:34:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:34:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 01:34:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 01:34:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 01:34:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 01:34:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:34:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:34:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 01:34:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 01:34:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 01:34:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 01:34:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:34:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-20 01:34:58,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 01:34:58,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270954336] [2022-07-20 01:34:58,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270954336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 01:34:58,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 01:34:58,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 01:34:58,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157447780] [2022-07-20 01:34:58,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 01:34:58,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 01:34:58,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 01:34:58,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 01:34:58,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-20 01:34:58,456 INFO L87 Difference]: Start difference. First operand 20775 states and 30284 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (23), 8 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-20 01:35:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 01:35:13,891 INFO L93 Difference]: Finished difference Result 61851 states and 93429 transitions. [2022-07-20 01:35:13,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 01:35:13,892 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (23), 8 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 186 [2022-07-20 01:35:13,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 01:35:14,093 INFO L225 Difference]: With dead ends: 61851 [2022-07-20 01:35:14,094 INFO L226 Difference]: Without dead ends: 41086 [2022-07-20 01:35:14,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2022-07-20 01:35:14,167 INFO L413 NwaCegarLoop]: 2896 mSDtfsCounter, 6904 mSDsluCounter, 6587 mSDsCounter, 0 mSdLazyCounter, 9105 mSolverCounterSat, 6488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7111 SdHoareTripleChecker+Valid, 9483 SdHoareTripleChecker+Invalid, 15593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6488 IncrementalHoareTripleChecker+Valid, 9105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-07-20 01:35:14,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7111 Valid, 9483 Invalid, 15593 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6488 Valid, 9105 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2022-07-20 01:35:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41086 states. [2022-07-20 01:35:16,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41086 to 32211. [2022-07-20 01:35:16,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32211 states, 22368 states have (on average 1.34585121602289) internal successors, (30104), 23071 states have internal predecessors, (30104), 8010 states have call successors, (8010), 1749 states have call predecessors, (8010), 1832 states have return successors, (8761), 7864 states have call predecessors, (8761), 8001 states have call successors, (8761) [2022-07-20 01:35:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32211 states to 32211 states and 46875 transitions. [2022-07-20 01:35:16,483 INFO L78 Accepts]: Start accepts. Automaton has 32211 states and 46875 transitions. Word has length 186 [2022-07-20 01:35:16,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 01:35:16,484 INFO L495 AbstractCegarLoop]: Abstraction has 32211 states and 46875 transitions. [2022-07-20 01:35:16,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (23), 8 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-20 01:35:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 32211 states and 46875 transitions. [2022-07-20 01:35:16,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-20 01:35:16,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 01:35:16,504 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2022-07-20 01:35:16,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 01:35:16,505 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 01:35:16,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 01:35:16,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1620364600, now seen corresponding path program 1 times [2022-07-20 01:35:16,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 01:35:16,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952434279] [2022-07-20 01:35:16,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 01:35:16,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 01:35:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 01:35:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:35:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:35:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 01:35:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 01:35:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:35:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:35:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 01:35:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 01:35:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:35:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:35:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-20 01:35:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:35:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 01:35:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 01:35:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 01:35:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 01:35:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:35:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:35:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 01:35:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-20 01:35:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-20 01:35:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-20 01:35:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-20 01:35:16,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 01:35:16,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952434279] [2022-07-20 01:35:16,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952434279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 01:35:16,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 01:35:16,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 01:35:16,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269869992] [2022-07-20 01:35:16,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 01:35:16,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 01:35:16,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 01:35:16,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 01:35:16,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-20 01:35:16,953 INFO L87 Difference]: Start difference. First operand 32211 states and 46875 transitions. Second operand has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (26), 9 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-20 01:35:38,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 01:35:38,736 INFO L93 Difference]: Finished difference Result 92912 states and 143084 transitions. [2022-07-20 01:35:38,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 01:35:38,737 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (26), 9 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 203 [2022-07-20 01:35:38,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 01:35:39,141 INFO L225 Difference]: With dead ends: 92912 [2022-07-20 01:35:39,141 INFO L226 Difference]: Without dead ends: 60711 [2022-07-20 01:35:39,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2022-07-20 01:35:39,305 INFO L413 NwaCegarLoop]: 2792 mSDtfsCounter, 7706 mSDsluCounter, 8295 mSDsCounter, 0 mSdLazyCounter, 12861 mSolverCounterSat, 7259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7927 SdHoareTripleChecker+Valid, 11087 SdHoareTripleChecker+Invalid, 20120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7259 IncrementalHoareTripleChecker+Valid, 12861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2022-07-20 01:35:39,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7927 Valid, 11087 Invalid, 20120 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7259 Valid, 12861 Invalid, 0 Unknown, 0 Unchecked, 17.2s Time] [2022-07-20 01:35:39,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60711 states. [2022-07-20 01:35:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60711 to 32211. [2022-07-20 01:35:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32211 states, 22368 states have (on average 1.34585121602289) internal successors, (30104), 23071 states have internal predecessors, (30104), 8010 states have call successors, (8010), 1749 states have call predecessors, (8010), 1832 states have return successors, (8761), 7864 states have call predecessors, (8761), 8001 states have call successors, (8761) [2022-07-20 01:35:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32211 states to 32211 states and 46875 transitions. [2022-07-20 01:35:42,296 INFO L78 Accepts]: Start accepts. Automaton has 32211 states and 46875 transitions. Word has length 203 [2022-07-20 01:35:42,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 01:35:42,296 INFO L495 AbstractCegarLoop]: Abstraction has 32211 states and 46875 transitions. [2022-07-20 01:35:42,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (26), 9 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-20 01:35:42,297 INFO L276 IsEmpty]: Start isEmpty. Operand 32211 states and 46875 transitions. [2022-07-20 01:35:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-20 01:35:42,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 01:35:42,317 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2022-07-20 01:35:42,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 01:35:42,317 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 01:35:42,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 01:35:42,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1718121921, now seen corresponding path program 1 times [2022-07-20 01:35:42,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 01:35:42,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709472027] [2022-07-20 01:35:42,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 01:35:42,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 01:35:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 01:35:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:35:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:35:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 01:35:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 01:35:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:35:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:35:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 01:35:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 01:35:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:35:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:35:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 01:35:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:35:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:35:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 01:35:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-20 01:35:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:35:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 01:35:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 01:35:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 01:35:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 01:35:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:35:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:35:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 01:35:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-20 01:35:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-20 01:35:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-20 01:35:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-20 01:35:42,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 01:35:42,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709472027] [2022-07-20 01:35:42,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709472027] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 01:35:42,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749488585] [2022-07-20 01:35:42,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 01:35:42,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 01:35:42,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 01:35:42,790 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-20 01:35:42,791 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-20 01:35:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:43,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 2553 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 01:35:43,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 01:35:43,884 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-20 01:35:43,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 01:35:43,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749488585] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 01:35:43,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 01:35:43,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-20 01:35:43,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352998158] [2022-07-20 01:35:43,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 01:35:43,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 01:35:43,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 01:35:43,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 01:35:43,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-20 01:35:43,893 INFO L87 Difference]: Start difference. First operand 32211 states and 46875 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-20 01:35:46,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 01:35:46,705 INFO L93 Difference]: Finished difference Result 71007 states and 103338 transitions. [2022-07-20 01:35:46,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 01:35:46,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 228 [2022-07-20 01:35:46,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 01:35:46,889 INFO L225 Difference]: With dead ends: 71007 [2022-07-20 01:35:46,890 INFO L226 Difference]: Without dead ends: 38806 [2022-07-20 01:35:46,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-20 01:35:46,986 INFO L413 NwaCegarLoop]: 2531 mSDtfsCounter, 2115 mSDsluCounter, 1841 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2115 SdHoareTripleChecker+Valid, 4372 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 01:35:46,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2115 Valid, 4372 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 01:35:47,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38806 states. [2022-07-20 01:35:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38806 to 38774. [2022-07-20 01:35:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38774 states, 26982 states have (on average 1.3472685494033059) internal successors, (36352), 27807 states have internal predecessors, (36352), 9606 states have call successors, (9606), 2090 states have call predecessors, (9606), 2185 states have return successors, (10463), 9430 states have call predecessors, (10463), 9597 states have call successors, (10463) [2022-07-20 01:35:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38774 states to 38774 states and 56421 transitions. [2022-07-20 01:35:49,473 INFO L78 Accepts]: Start accepts. Automaton has 38774 states and 56421 transitions. Word has length 228 [2022-07-20 01:35:49,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 01:35:49,473 INFO L495 AbstractCegarLoop]: Abstraction has 38774 states and 56421 transitions. [2022-07-20 01:35:49,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-20 01:35:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 38774 states and 56421 transitions. [2022-07-20 01:35:49,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-07-20 01:35:49,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 01:35:49,504 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-07-20 01:35:49,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 01:35:49,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-20 01:35:49,720 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 01:35:49,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 01:35:49,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1894528937, now seen corresponding path program 1 times [2022-07-20 01:35:49,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 01:35:49,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429862262] [2022-07-20 01:35:49,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 01:35:49,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 01:35:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:49,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 01:35:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:49,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:35:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:49,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:35:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:49,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 01:35:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:49,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 01:35:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:49,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:35:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:49,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:35:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:49,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 01:35:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:49,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 01:35:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:35:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:35:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 01:35:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:35:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:35:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 01:35:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 01:35:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-20 01:35:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:35:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 01:35:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 01:35:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 01:35:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 01:35:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:35:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:35:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 01:35:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-20 01:35:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-20 01:35:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-20 01:35:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:35:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-20 01:35:50,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 01:35:50,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429862262] [2022-07-20 01:35:50,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429862262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 01:35:50,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 01:35:50,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-20 01:35:50,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205855992] [2022-07-20 01:35:50,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 01:35:50,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 01:35:50,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 01:35:50,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 01:35:50,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-07-20 01:35:50,260 INFO L87 Difference]: Start difference. First operand 38774 states and 56421 transitions. Second operand has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 5 states have internal predecessors, (140), 3 states have call successors, (29), 10 states have call predecessors, (29), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-20 01:36:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 01:36:20,291 INFO L93 Difference]: Finished difference Result 108472 states and 166707 transitions. [2022-07-20 01:36:20,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-20 01:36:20,292 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 5 states have internal predecessors, (140), 3 states have call successors, (29), 10 states have call predecessors, (29), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 247 [2022-07-20 01:36:20,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 01:36:20,756 INFO L225 Difference]: With dead ends: 108472 [2022-07-20 01:36:20,757 INFO L226 Difference]: Without dead ends: 69708 [2022-07-20 01:36:20,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2022-07-20 01:36:20,865 INFO L413 NwaCegarLoop]: 3264 mSDtfsCounter, 6928 mSDsluCounter, 13643 mSDsCounter, 0 mSdLazyCounter, 18178 mSolverCounterSat, 5245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7151 SdHoareTripleChecker+Valid, 16907 SdHoareTripleChecker+Invalid, 23423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5245 IncrementalHoareTripleChecker+Valid, 18178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2022-07-20 01:36:20,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7151 Valid, 16907 Invalid, 23423 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5245 Valid, 18178 Invalid, 0 Unknown, 0 Unchecked, 23.6s Time] [2022-07-20 01:36:20,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69708 states. [2022-07-20 01:36:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69708 to 38789. [2022-07-20 01:36:24,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38789 states, 26987 states have (on average 1.347204209434172) internal successors, (36357), 27807 states have internal predecessors, (36357), 9616 states have call successors, (9616), 2090 states have call predecessors, (9616), 2185 states have return successors, (10473), 9435 states have call predecessors, (10473), 9607 states have call successors, (10473) [2022-07-20 01:36:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38789 states to 38789 states and 56446 transitions. [2022-07-20 01:36:24,207 INFO L78 Accepts]: Start accepts. Automaton has 38789 states and 56446 transitions. Word has length 247 [2022-07-20 01:36:24,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 01:36:24,208 INFO L495 AbstractCegarLoop]: Abstraction has 38789 states and 56446 transitions. [2022-07-20 01:36:24,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 5 states have internal predecessors, (140), 3 states have call successors, (29), 10 states have call predecessors, (29), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-20 01:36:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand 38789 states and 56446 transitions. [2022-07-20 01:36:24,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-07-20 01:36:24,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 01:36:24,226 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 01:36:24,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 01:36:24,227 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 01:36:24,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 01:36:24,227 INFO L85 PathProgramCache]: Analyzing trace with hash -891727683, now seen corresponding path program 1 times [2022-07-20 01:36:24,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 01:36:24,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712301678] [2022-07-20 01:36:24,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 01:36:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 01:36:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 01:36:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:36:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:36:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 01:36:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-20 01:36:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:36:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:36:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 01:36:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:36:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:36:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 01:36:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 01:36:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-20 01:36:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 01:36:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 01:36:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 01:36:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 01:36:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 01:36:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 01:36:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 01:36:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-20 01:36:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 01:36:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-20 01:36:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-20 01:36:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-20 01:36:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:36:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-20 01:36:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:36:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:36:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-20 01:36:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-20 01:36:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-20 01:36:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-20 01:36:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-20 01:36:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:24,647 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-20 01:36:24,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 01:36:24,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712301678] [2022-07-20 01:36:24,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712301678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 01:36:24,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 01:36:24,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 01:36:24,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476440344] [2022-07-20 01:36:24,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 01:36:24,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 01:36:24,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 01:36:24,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 01:36:24,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 01:36:24,650 INFO L87 Difference]: Start difference. First operand 38789 states and 56446 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-20 01:36:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 01:36:45,832 INFO L93 Difference]: Finished difference Result 128490 states and 196599 transitions. [2022-07-20 01:36:45,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 01:36:45,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 259 [2022-07-20 01:36:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 01:36:46,547 INFO L225 Difference]: With dead ends: 128490 [2022-07-20 01:36:46,548 INFO L226 Difference]: Without dead ends: 89711 [2022-07-20 01:36:46,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2022-07-20 01:36:46,675 INFO L413 NwaCegarLoop]: 2149 mSDtfsCounter, 7407 mSDsluCounter, 5073 mSDsCounter, 0 mSdLazyCounter, 6697 mSolverCounterSat, 6133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7589 SdHoareTripleChecker+Valid, 7222 SdHoareTripleChecker+Invalid, 12830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6133 IncrementalHoareTripleChecker+Valid, 6697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-07-20 01:36:46,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7589 Valid, 7222 Invalid, 12830 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6133 Valid, 6697 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2022-07-20 01:36:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89711 states. [2022-07-20 01:36:52,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89711 to 71119. [2022-07-20 01:36:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71119 states, 49609 states have (on average 1.3663448164647545) internal successors, (67783), 51431 states have internal predecessors, (67783), 17065 states have call successors, (17065), 4023 states have call predecessors, (17065), 4444 states have return successors, (21669), 16776 states have call predecessors, (21669), 17048 states have call successors, (21669) [2022-07-20 01:36:53,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71119 states to 71119 states and 106517 transitions. [2022-07-20 01:36:53,387 INFO L78 Accepts]: Start accepts. Automaton has 71119 states and 106517 transitions. Word has length 259 [2022-07-20 01:36:53,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 01:36:53,388 INFO L495 AbstractCegarLoop]: Abstraction has 71119 states and 106517 transitions. [2022-07-20 01:36:53,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-20 01:36:53,388 INFO L276 IsEmpty]: Start isEmpty. Operand 71119 states and 106517 transitions. [2022-07-20 01:36:53,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2022-07-20 01:36:53,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 01:36:53,425 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 01:36:53,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 01:36:53,426 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 01:36:53,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 01:36:53,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1020658532, now seen corresponding path program 1 times [2022-07-20 01:36:53,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 01:36:53,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242269722] [2022-07-20 01:36:53,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 01:36:53,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 01:36:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:53,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 01:36:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:53,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:36:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:53,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:36:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:53,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 01:36:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:53,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 01:36:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:53,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:36:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:53,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:36:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:53,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 01:36:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:53,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 01:36:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:53,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:36:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:53,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:36:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:53,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 01:36:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:53,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:36:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:53,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:36:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:53,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 01:36:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:53,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 01:36:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-20 01:36:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 01:36:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 01:36:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-20 01:36:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 01:36:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 01:36:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 01:36:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-20 01:36:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 01:36:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-20 01:36:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 01:36:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-20 01:36:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-20 01:36:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-20 01:36:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-20 01:36:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-20 01:36:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-20 01:36:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-20 01:36:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-20 01:36:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-20 01:36:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-20 01:36:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-20 01:36:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-20 01:36:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-20 01:36:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:36:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 01:36:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 01:36:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 01:36:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 01:36:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 01:36:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 01:36:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 01:36:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-20 01:36:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2022-07-20 01:36:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-07-20 01:36:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 01:36:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-07-20 01:36:54,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 01:36:54,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242269722] [2022-07-20 01:36:54,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242269722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 01:36:54,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 01:36:54,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 01:36:54,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762660643] [2022-07-20 01:36:54,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 01:36:54,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 01:36:54,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 01:36:54,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 01:36:54,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-20 01:36:54,351 INFO L87 Difference]: Start difference. First operand 71119 states and 106517 transitions. Second operand has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (52), 10 states have call predecessors, (52), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-07-20 01:37:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 01:37:15,406 INFO L93 Difference]: Finished difference Result 183219 states and 290006 transitions. [2022-07-20 01:37:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 01:37:15,407 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (52), 10 states have call predecessors, (52), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 351 [2022-07-20 01:37:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 01:37:16,128 INFO L225 Difference]: With dead ends: 183219 [2022-07-20 01:37:16,129 INFO L226 Difference]: Without dead ends: 112120 [2022-07-20 01:37:16,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-07-20 01:37:16,574 INFO L413 NwaCegarLoop]: 2679 mSDtfsCounter, 3553 mSDsluCounter, 7709 mSDsCounter, 0 mSdLazyCounter, 6642 mSolverCounterSat, 2171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3912 SdHoareTripleChecker+Valid, 10388 SdHoareTripleChecker+Invalid, 8813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2171 IncrementalHoareTripleChecker+Valid, 6642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-07-20 01:37:16,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3912 Valid, 10388 Invalid, 8813 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2171 Valid, 6642 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2022-07-20 01:37:16,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112120 states.